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!)
A028301 a(n) = a(n-1)^2 + prime(n-1), with a(1) = 1. 1
1, 3, 12, 149, 22208, 493195275, 243241579282325638, 59166465891759909038312569872107061, 3500670686120788688272744016815662448699251721439983660470143846057740 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
nxt[{n_, a_}]:={n+1, a^2+Prime[n]}; NestList[nxt, {1, 1}, 9][[All, 2]] (* Harvey P. Dale, Aug 02 2017 *)
PROG
(Magma) [n le 1 select 1 else Self(n-1)^2 + NthPrime(n-1): n in [1..14]]; // G. C. Greubel, Jan 04 2024
(SageMath)
def a(n): return 1 if n==1 else a(n-1)^2 + nth_prime(n-1) # a = A028301
[a(n) for n in range(1, 15)] # G. C. Greubel, Jan 04 2024
CROSSREFS
Cf. A028300.
Sequence in context: A285603 A329471 A098152 * A356719 A004168 A301650
KEYWORD
nonn,easy
AUTHOR
A.R. Fink (fink(AT)cadvision.com)
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 19 11:14 EDT 2024. Contains 371791 sequences. (Running on oeis4.)