Generalising Tuenter's binomial sums

preprint2015arXivOpen access

Abstract

Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form Sr(n)=∑k(2nk)∣n−k∣r,S_r(n) = \sum_k \binom{2n}{k}|n-k|^r, where rr and nn are non-negative integers. We consider sums of the form Ur(n)=∑k(nk)∣n/2−k∣rU_r(n) = \sum_k \binom{n}{k}|n/2-k|^r which are a generalisation of Tuenter's sums as Sr(n)=Ur(2n)S_r(n) = U_r(2n) but Ur(n)U_r(n) is also well-defined for odd arguments nn. Ur(n)U_r(n) may be interpreted as a moment of a symmetric Bernoulli random walk with nn steps. The form of Ur(n)U_r(n) depends on the parities of both rr and nn. In fact, Ur(n)U_r(n) is the product of a polynomial (depending on the parities of rr and nn) 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)U_r(n) and/or the associated polynomials.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.