arXiv:2307.00566 [math.CO]AbstractReferencesReviewsResources
Proof of an explicit formula for a series from Ramanujan's Notebooks via tree functions
Published 2023-07-02Version 1
We prove a recent conjecture, due to Vigren and Dieckmann, about an explicit triple sum formula for a series from Ramanujan's Notebooks. We shall give two proofs: the first one is by evaluation and based on the identity \begin{equation*} \sum_{k=0}^\infty \frac{(x+k)^{m+k}}{k!}e^{-u(x+k)} u^k = \sum_{j=0}^\infty \sum_{i=0}^{m}\binom{m+j}{i} \stirl{m+j-i}{j}x^iu^j, \end{equation*} where $\genfrac\{\}{0pt}{}{n}{k}$ is a Stirling number of the second kind, and the second one is combinatorial in nature and by induction.
Comments: 7 pages
Categories: math.CO
Related articles: Most relevant | Search more
An explicit formula for the number of permutations with a given number of alternating runs
arXiv:1402.2340 [math.CO] (Published 2014-02-11)
An explicit formula for Bernoulli polynomials in terms of $r$-Stirling numbers of the second kind
arXiv:0906.3405 [math.CO] (Published 2009-06-18)
A formula for the doubly-refined enumeration of alternating sign matrices