On an identity by Ercolani, Lega, and Tippings

2024/01/17 by Yattselev, Maxim L.
#05C30 #33C05 #Classical Analysis and ODEs (math.CA) #FOS: Mathematics

paper · doi:10.48550/arxiv.2401.09562

Abstract

In this note we prove that j! 2^N \binomN+j-1j ₂F₁(\beginmatrix-j,-2j
-N-j+1 \endmatrix;-1) = ∑_l=0^N \binomNl∏_i=0^j-12(2i+1+l), where N and j are positive integers, which resolves a question posed by Ercolani, Lega, and Tippings.

Related

• On some Binomial Coefficient Identities with Applications
• A combinatorial interpretation for the identity Sum_k=0ⁿ binomnk Sum_j=0^k binomkj³= Sum_k=0ⁿ binomnk²binom2kk
• Proof of a congruence on sums of powers of q-binomial coefficients
• A short proof of a famous combinatorial identity
• On Some Series Involving the Central Binomial Coefficients