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!)
A053294 a(0)=1, a(m+1) = Sum_{k=0..m}[a(k)^2 * a(m-k)^2]. 1
1, 1, 2, 9, 170, 57978, 6722955416, 90396259057770600841, 16342967303279146791599896178138243550346 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(9) = 5.341...*10^80 is too large to include in the data section. - Amiram Eldar, Oct 02 2021
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..12
Jean-Marc Luck, Revisiting log-periodic oscillations, arXiv:2403.00432 [cond-mat.stat-mech], 2024. See p. 7.
EXAMPLE
a(4)= a(0)^2*a(3)^2 + a(1)^2*a(2)^2 + a(2)^2*a(1)^2 + a(3)^2*a(0)^2 = 1^2*9^2 + 1^2*2^2 + 2^2*1^2 + 9^2*1^2 = 170.
MATHEMATICA
a[0] = 1; a[n_] := a[n] = Sum[a[k]^2*a[n - 1 - k]^2, {k, 0, n - 1}]; Array[a, 9, 0] (* Amiram Eldar, Oct 02 2021 *)
CROSSREFS
Sequence in context: A038843 A367526 A237201 * A199695 A349691 A078524
KEYWORD
nonn
AUTHOR
Leroy Quet, Mar 04 2000
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 May 15 20:14 EDT 2024. Contains 372549 sequences. (Running on oeis4.)