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!)
A069103 a(1) = 1; a(2) = 1; a(n) = prime(a(n-1)) + prime(a(n-2)) if n > 2. 6

%I #13 Sep 19 2019 02:18:35

%S 1,1,4,9,30,136,882,7626,84448,1159912,19226112,376464500,8556370952,

%T 222510227460,6542050923204,215278202878118,7860760142260830,

%U 316135809596510856

%N a(1) = 1; a(2) = 1; a(n) = prime(a(n-1)) + prime(a(n-2)) if n > 2.

%e a(3) = prime(a(2)) + prime(a(1)) = 2 + 2 = 4.

%t f[x_] := Prime[f[x-1]]+Prime[f[x-2]] {f[1]=1, f[2]=1}; Table[f[w], {w, 1, 15}]

%t nxt[{a_,b_}]:={b,Prime[a]+Prime[b]}; Join[{1},Union[Flatten[NestList[nxt,{1,1},13]]]] (* _Harvey P. Dale_, Sep 17 2013 *)

%K nonn,more

%O 1,3

%A _Joseph L. Pe_, Apr 06 2002

%E More terms from _Labos Elemer_, Apr 11 2003

%E a(16)-a(18) from _Chai Wah Wu_, Sep 18 2019

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)