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!)
A352470 a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/2)} binomial(n,2*k+1)^2 * a(n-2*k-1). 2
1, 1, 4, 37, 608, 15601, 576472, 28993693, 1904637184, 158352856129, 16253786050904, 2018684970206653, 298373110433984192, 51757706826973479697, 10412613242348421164400, 2404755328388872932588037, 631887117002962512609921024, 187441600433239155105076467457 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
Sum_{n>=0} a(n) * x^n / n!^2 = 1 / (1 - Sum_{n>=0} x^(2*n+1) / (2*n+1)!^2).
Sum_{n>=0} a(n) * x^n / n!^2 = 1 / (1 - (BesselI(0,2*sqrt(x)) - BesselJ(0,2*sqrt(x))) / 2).
MATHEMATICA
a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, 2 k + 1]^2 a[n - 2 k - 1], {k, 0, Floor[(n - 1)/2]}]; Table[a[n], {n, 0, 17}]
nmax = 17; CoefficientList[Series[1/(1 - Sum[x^(2 k + 1)/(2 k + 1)!^2, {k, 0, nmax}]), {x, 0, nmax}], x] Range[0, nmax]!^2
CROSSREFS
Sequence in context: A133471 A249607 A097998 * A177385 A155926 A094408
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 17 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 April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)