[go: up one dir, main page]

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!)
A363655 a(0) = 1; for n > 0, a(n) = prime( Sum_{k=0..n-1} a(k) * a(n-k-1) ). 0
1, 2, 7, 61, 863, 17569, 472741, 16007419, 659408567, 32231133931, 1833425773489, 119498316410171, 8810846732918257, 727089137774221667 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
G.f.: sqrt( Sum_{n>=0} index of prime a(n+1) * x^n ).
MATHEMATICA
a[0] = 1; a[n_] := a[n] = Prime[Sum[a[k] a[n - k - 1], {k, 0, n - 1}]]; Table[a[n], {n, 0, 11}]
CROSSREFS
Sequence in context: A255904 A046846 A111010 * A089307 A367902 A102896
KEYWORD
nonn,hard,more
AUTHOR
Ilya Gutkovskiy, Jun 13 2023
EXTENSIONS
a(12)-a(13) from Amiram Eldar, Jun 13 2023
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 August 30 00:57 EDT 2024. Contains 375520 sequences. (Running on oeis4.)