Bounds for the length of recurrence relations for convolutions of P-recursive sequences (Q1367597): Difference between revisions

Let \(S_r(n)\) denote the sum of the \(r\)th powers of the binomial coefficients \({n \choose k}\), where \(0\leq k\leq n\). Franel's conjecture states that \(S_r(n)\) satisfies a linear recurrence of length \([{1\over 2} (r+1)]\), where the coefficients in the linear recurrence are polynomial functions of \(n\). The author proves Franel's conjecture, as well as a more general theorem.