login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082096 A 2nd order recursion: a(1)=a(2)=1; a(n) = prime(a(n-2)+a(n-1)) = A000040(a(n-2)+a(n-1)). 3
1, 1, 3, 7, 29, 151, 1069, 9887, 115891, 1666421, 28700933, 580669933, 13578126713, 362075579539, 10886955278951, 365589325548857, 13598064388599629, 556220494250764093 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..18.

MATHEMATICA

a[n_]:= a[n]= If[n<3, 1, Prime[a[n-1]+a[n-2]]]; Table[a[n], {n, 13}] (* modified by G. C. Greubel, Aug 31 2019 *)

nxt[{a_, b_}]:={b, Prime[a+b]}; Transpose[NestList[nxt, {1, 1}, 13]][[1]] (* Harvey P. Dale, Oct 02 2013 *)

PROG

(MAGMA) a:= func< n | n lt 3 select 1 else NthPrime(Self(n-1) + Self(n-2)) >;

[a(n): n in [1..12]]; // G. C. Greubel, Aug 31 2019

CROSSREFS

Cf. A069103, A082094, A082095.

Sequence in context: A211371 A302157 A294383 * A119325 A048722 A061955

Adjacent sequences:  A082093 A082094 A082095 * A082097 A082098 A082099

KEYWORD

nonn,more

AUTHOR

Labos Elemer, Apr 11 2003

EXTENSIONS

a(15) from G. C. Greubel, Aug 31 2019

a(16)-a(18) from Chai Wah Wu, Sep 18 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 15:11 EST 2019. Contains 329960 sequences. (Running on oeis4.)