Generalizing Tuenter's binomial sums

From MaRDI portal



Abstract: Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form [S_r(n) = sum_k �inom{2n}{k}|n-k|^r,] where r and n are non-negative integers. We consider sums of the form [U_r(n) = sum_k �inom{n}{k}|n/2-k|^r] which are a generalisation of Tuenter's sums as Sr(n)=Ur(2n) but Ur(n) is also well-defined for odd arguments n. Ur(n) may be interpreted as a moment of a symmetric Bernoulli random walk with n steps. The form of Ur(n) depends on the parities of both r and n. In fact, Ur(n) is the product of a polynomial (depending on the parities of r and n) times a power of two or a binomial coefficient. In all cases the polynomials can be expressed in terms of Dumont-Foata polynomials. We give recurrence relations, generating functions and explicit formulas for the functions Ur(n) and/or the associated polynomials.





Describes a project that uses

Uses Software






This page was built for publication: Generalizing Tuenter's binomial sums

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