cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A069103 #13 Sep 19 2019 02:18:35
%S A069103 1,1,4,9,30,136,882,7626,84448,1159912,19226112,376464500,8556370952,
%T A069103 222510227460,6542050923204,215278202878118,7860760142260830,
%U A069103 316135809596510856
%N A069103 a(1) = 1; a(2) = 1; a(n) = prime(a(n-1)) + prime(a(n-2)) if n > 2.
%e A069103 a(3) = prime(a(2)) + prime(a(1)) = 2 + 2 = 4.
%t A069103 f[x_] := Prime[f[x-1]]+Prime[f[x-2]] {f[1]=1, f[2]=1}; Table[f[w], {w, 1, 15}]
%t A069103 nxt[{a_,b_}]:={b,Prime[a]+Prime[b]}; Join[{1},Union[Flatten[NestList[nxt,{1,1},13]]]] (* _Harvey P. Dale_, Sep 17 2013 *)
%K A069103 nonn,more
%O A069103 1,3
%A A069103 _Joseph L. Pe_, Apr 06 2002
%E A069103 More terms from _Labos Elemer_, Apr 11 2003
%E A069103 a(16)-a(18) from _Chai Wah Wu_, Sep 18 2019