2022/08/02 by Harold R. Parks, Parks, Harold R., Dean C. Wills +1
Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #graph theory and CDMA systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2208.01224
openalex publication_date 2022/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give a combinatorial proof of a formula giving the partial sums of the k-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the k-bonacci numbers.