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!)
A349591 G.f. A(x) satisfies: A(x) = 1 / (1 - 2*x) + x * (1 - 2*x)^6 * A(x)^8. 4
1, 3, 16, 160, 2216, 35110, 596016, 10573748, 193586424, 3629709697, 69342483276, 1344897261828, 26411276859800, 524117511080056, 10493756451964088, 211719733855698808, 4300202981875132408, 87854045612854431128, 1804215079309443709632 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Second binomial transform of A007556.
LINKS
FORMULA
a(n) = Sum_{k=0..n} binomial(n,k) * binomial(8*k,k) * 2^(n-k) / (7*k+1).
a(n) = 2^n*F([1/8, 1/4, 3/8, 1/2, 5/8, 3/4, 7/8, -n], [2/7, 3/7, 4/7, 5/7, 6/7, 1, 8/7], -2^23/7^7), where F is the generalized hypergeometric function. - Stefano Spezia, Nov 22 2021
a(n) ~ 2^(n - 67/2) * 9212151^(n + 3/2) / (sqrt(Pi) * n^(3/2) * 7^(7*n + 3/2)). - Vaclav Kotesovec, Nov 26 2021
MATHEMATICA
nmax = 18; A[_] = 0; Do[A[x_] = 1/(1 - 2 x) + x (1 - 2 x)^6 A[x]^8 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[Binomial[n, k] Binomial[8 k, k] 2^(n - k)/(7 k + 1), {k, 0, n}], {n, 0, 18}]
PROG
(PARI) a(n) = sum(k=0, n, binomial(n, k)*binomial(8*k, k)*2^(n-k)/(7*k+1)); \\ Michel Marcus, Nov 23 2021
CROSSREFS
Sequence in context: A228513 A135753 A191959 * A091146 A350415 A277458
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 24 13:23 EDT 2024. Contains 374584 sequences. (Running on oeis4.)