

A082096


A 2nd order recursion: a(1)=a(2)=1; a(n) = prime(a(n2)+a(n1)) = A000040(a(n2)+a(n1)).


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[n1]+a[n2]]]; 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(n1) + Self(n2)) >;
[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



