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.

Original entry on oeis.org

1, 1, 4, 9, 30, 136, 882, 7626, 84448, 1159912, 19226112, 376464500, 8556370952, 222510227460, 6542050923204, 215278202878118, 7860760142260830, 316135809596510856
Offset: 1

Views

Author

Joseph L. Pe, Apr 06 2002

Keywords

Examples

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

Programs

  • Mathematica
    f[x_] := Prime[f[x-1]]+Prime[f[x-2]] {f[1]=1, f[2]=1}; Table[f[w], {w, 1, 15}]
    nxt[{a_,b_}]:={b,Prime[a]+Prime[b]}; Join[{1},Union[Flatten[NestList[nxt,{1,1},13]]]] (* Harvey P. Dale, Sep 17 2013 *)

Extensions

More terms from Labos Elemer, Apr 11 2003
a(16)-a(18) from Chai Wah Wu, Sep 18 2019