login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A346065
a(n) = Sum_{k=0..n} binomial(6*k,k) / (5*k + 1).
7
1, 2, 8, 59, 565, 6046, 68878, 818276, 10021910, 125629220, 1603943486, 20783993414, 272641113110, 3613484662965, 48313969712685, 650888627139801, 8826840286257595, 120398870546499685, 1650711840886884265, 22735860619151166130, 314441081323870331656
OFFSET
0,2
COMMENTS
Partial sums of A002295.
In general, for m > 1, Sum_{k=0..n} binomial(m*k,k) / ((m-1)*k + 1) ~ m^(m*(n+1) + 1/2) / (sqrt(2*Pi) * (m^m - (m-1)^(m-1)) * n^(3/2) * (m-1)^((m-1)*n + 3/2)). - Vaclav Kotesovec, Jul 28 2021
LINKS
FORMULA
G.f. A(x) satisfies: A(x) = 1 / (1 - x) + x * (1 - x)^5 * A(x)^6.
a(n) ~ 2^(6*n + 6) * 3^(6*n + 13/2) / (43531 * sqrt(Pi) * n^(3/2) * 5^(5*n + 3/2)). - Vaclav Kotesovec, Jul 28 2021
MATHEMATICA
Table[Sum[Binomial[6 k, k]/(5 k + 1), {k, 0, n}], {n, 0, 20}]
nmax = 20; A[_] = 0; Do[A[x_] = 1/(1 - x) + x (1 - x)^5 A[x]^6 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
PROG
(PARI) a(n) = sum(k=0, n, binomial(6*k, k)/(5*k+1)); \\ Michel Marcus, Jul 28 2021
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jul 28 2021
STATUS
approved