login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A349582 G.f. A(x) satisfies: A(x) = 1 / (1 - 2*x) + x * (1 - 2*x)^3 * A(x)^5. 4
1, 3, 13, 85, 733, 7292, 78267, 880250, 10226237, 121713373, 1476272394, 18180126906, 226704989103, 2856790765238, 36321840773980, 465362291912648, 6002272018481901, 77873186277771107, 1015583616140910999, 13306207249869273003, 175064043975233981626 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Second binomial transform of A002294.
LINKS
FORMULA
a(n) = Sum_{k=0..n} binomial(n,k) * binomial(5*k,k) * 2^(n-k) / (4*k+1).
a(n) = 2^n*F([1/5, 2/5, 3/5, 4/5, -n], [1/2, 3/4, 1, 5/4], -5^5/2^9), where F is the generalized hypergeometric function. - Stefano Spezia, Nov 22 2021
a(n) ~ 3637^(n + 3/2) / (78125 * sqrt(Pi) * n^(3/2) * 2^(8*n + 7/2)). - Vaclav Kotesovec, Nov 26 2021
MATHEMATICA
nmax = 20; A[_] = 0; Do[A[x_] = 1/(1 - 2 x) + x (1 - 2 x)^3 A[x]^5 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[Binomial[n, k] Binomial[5 k, k] 2^(n - k)/(4 k + 1), {k, 0, n}], {n, 0, 20}]
PROG
(PARI) a(n) = sum(k=0, n, binomial(n, k)*binomial(5*k, k)*2^(n-k)/(4*k+1)); \\ Michel Marcus, Nov 23 2021
CROSSREFS
Sequence in context: A369550 A125500 A121679 * A246387 A023037 A354436
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Nov 22 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 19:52 EDT 2024. Contains 374323 sequences. (Running on oeis4.)