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

%I #12 Nov 21 2020 05:10:20

%S 2,5,14,54,294,2182,21168,258584,3866528,69094248,1446704598,

%T 34928585060,959616504858,29669964598708,1022713744909606,

%U 38985339660148638,1631985092027500964

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

%e a(2) = prime(2) + prime(5) = 3 + 11 = 14.

%p A122594 := proc(n) option remember: if(n=0)then return 2: elif(n=1)then return 5: else return ithprime(procname(n-1)) + ithprime(procname(n-2)): fi: end:

%p seq(A122594(n),n=0..8); # _Nathaniel Johnston_, Apr 26 2011

%t Transpose[NestList[{#[[2]],Prime[ #[[1]]]+Prime[ #[[2]]]}&,{1, 2},13]][[2]]

%Y Cf. A069103, A107327.

%K nonn,more

%O 0,1

%A _Carlos Alves_, Oct 29 2006

%E a(14)-a(16) from _Jinyuan Wang_, Nov 21 2020

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 July 19 01:31 EDT 2024. Contains 374388 sequences. (Running on oeis4.)