The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A354733 a(0) = a(1) = 1; a(n) = 2 * Sum_{k=0..n-2} a(k) * a(n-k-2). 5
1, 1, 2, 4, 10, 24, 64, 168, 464, 1280, 3624, 10304, 29728, 86240, 252480, 743040, 2200640, 6547200, 19571200, 58727680, 176883200, 534476800, 1619912320, 4923070464, 14999764480, 45807916544, 140196076544, 429931051008, 1320905583616, 4065358827520 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
G.f. A(x) satisfies: A(x) = 1 + x + 2 * (x * A(x))^2.
G.f.: (1 - sqrt(1 - 8 * x^2 * (1 + x))) / (4 * x^2).
a(n) ~ 5^(1/4) * (1 + sqrt(5))^(n+2) / (8 * sqrt(Pi) * n^(3/2)). - Vaclav Kotesovec, Jun 04 2022
a(n) = Sum_{k=0..floor(n/2)} 2^k * binomial(k+1,n-2*k) * A000108(k). - Seiichi Manyama, Nov 05 2023
MATHEMATICA
a[0] = a[1] = 1; a[n_] := a[n] = 2 Sum[a[k] a[n - k - 2], {k, 0, n - 2}]; Table[a[n], {n, 0, 29}]
nmax = 29; CoefficientList[Series[(1 - Sqrt[1 - 8 x^2 (1 + x)])/(4 x^2), {x, 0, nmax}], x]
PROG
(PARI) a(n) = sum(k=0, n\2, 2^k*binomial(k+1, n-2*k)*binomial(2*k, k)/(k+1)); \\ Seiichi Manyama, Nov 05 2023
CROSSREFS
Sequence in context: A294410 A121704 A049144 * A336419 A049131 A084078
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jun 04 2022
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 June 11 03:59 EDT 2024. Contains 373288 sequences. (Running on oeis4.)