{"doi":"10.1145/571922.571950","title":"Binomial coefficient recursion","abstract":"<jats:p>\n            The binomial coefficient or, alternatively, the number of combinations of\n            <jats:italic>n</jats:italic>\n            items taken\n            <jats:italic>k</jats:italic>\n            at a time, provides two defining recurrences. One of these provides a very useful recursive function a very\n            <jats:italic>good</jats:italic>\n            way for a program to calculate this function. The other provides a very wasteful recursive function the balancing\n            <jats:italic>bad and ugly</jats:italic>\n            way.\n          </jats:p>","journal":"ACM SIGCSE Bulletin","year":2001,"id":29212,"datarank":1.0387102317898953,"base_score":2.302585092994046,"endowment":2.302585092994046,"self_citation_contribution":0.3453877639491069,"citation_network_contribution":0.6933224678407883,"self_endowment_contribution":0.3453877639491069,"citer_contribution":0.6933224678407883,"corpus_percentile":null,"corpus_rank":null,"citation_count":9,"citer_count":8,"citers_with_citation_signal":6,"citers_with_endowment":6,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":161631,"name":"Timothy Rolfe","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.302585092994046,"endowment":2.302585092994046,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W2018157348","authors":[],"funders":[],"total_grants":0,"fwci":1.0932,"citation_percentile":0.8367793,"influential_citations":0,"citation_trend":[{"year":2012,"count":1},{"year":2020,"count":2},{"year":2021,"count":1},{"year":2023,"count":1},{"year":2025,"count":1}],"oa_status":"closed","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"https://dl.acm.org/doi/10.1145/571922.571950","host_type":"publisher"},{"url":"https://dl.acm.org/doi/pdf/10.1145/571922.571950","host_type":"publisher"},{"url":"https://doi.org/10.1145/571922.571950","host_type":"journal"}],"fields_of_study":["Logic, programming, and type systems","Formal Methods in Verification","Software Testing and Debugging Techniques","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Recursion (computer science)","Binomial coefficient","Binomial (polynomial)","Function (biology)","Negative binomial distribution","Binomial theorem","Mathematics","Applied mathematics","Computer science","Statistics","Algorithm","Discrete mathematics"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Responsible consumption and production"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T22:53:20.591894Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}