Recurrences for sums of powers of binomial coefficients

DOI10.1016/0097-3165(89)90063-0MaRDI QIDQ1823940zbMATH OpenOpenAlexFDO

Authors Thomas W. Cusick

Publication date 1989

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(89)90063-0

zbMATH Keywords

binomial coefficientsrecurrence relation

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

Let \(S_ n^{(r)}=\sum^{n}_{k=0}\left( \begin{matrix} n\\ k\end{matrix} \right)^ r\) \((r=1,2,...)\). An elementary method is given for finding recurrence relation for \(S_ n^{(r)}\) with \([(r+3)/2]\) terms. This confirms a conjecture of Franel. This method could easily be implemented on a computer and would require vastly less computation than Perlstadt's symbolic manipulation program MACSYMA. The recurrence relation obtained is of the type \(\sum^{k}_{j=0}b_ j^{(r)}(n)S^{(r)}_{n+1- j}=0.\) A closer examination of the proof would lead to determination of the degrees of the polynomials \(b_ j^{(r)}(n)\).

Recommendations

• Some recurrences for sums of powers of binomial coefficients
• Recurrences for alternating sums of powers of binomial coefficients
• A method to find the recurrence of sums of powers of binomial coefficient
• On recurrences for sums of powers of binomial coefficients
• Bounds for the length of recurrence relations for convolutions of P-recursive sequences

Cites work

• Differentiably finite power series
• Some recurrences for sums of powers of binomial coefficients

Cited in

(23)

• Binomial identities -- combinatorial and algorithmic aspects
• Bounds for the length of recurrence relations for convolutions of P-recursive sequences
• A generalization of Morley's congruence
• Recurrences for alternating sums of powers of binomial coefficients
• An algorithm for finding recurrence relations of binomial sums and its complexity
• A note on Franel numbers and \(\mathrm{SU}(3)\)
• Generating functions for finite sums involving higher powers of binomial coefficients: analysis of hypergeometric functions including new families of polynomials and numbers
• Generalized exponential sums and the power of computers
• Catalan and Apéry numbers in residue classes
• scientific article; zbMATH DE number 3859211 (Why is no real title available?)
• The value of certain combinatorics sum
• scientific article; zbMATH DE number 4154453 (Why is no real title available?)
• A method to find the recurrence of sums of powers of binomial coefficient
• scientific article; zbMATH DE number 4099408 (Why is no real title available?)
• scientific article; zbMATH DE number 109191 (Why is no real title available?)
• scientific article; zbMATH DE number 2021382 (Why is no real title available?)
• Supercongruences for some lacunary sums of powers of binomial coefficients
• scientific article; zbMATH DE number 1416097 (Why is no real title available?)
• On recurrences for sums of powers of binomial coefficients
• Some recurrences for sums of powers of binomial coefficients
• Supercongruences for the Catalan-Larcombe-French numbers
• Recurrence relations for sums of binomial coefficients and some generalizations
• Some congruences with \(q\)-binomial sums

Describes a project that uses

Uses Software

• MACSYMA

This page was built for publication: Recurrences for sums of powers of binomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823940)