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.

A126092 a(1)=2, a(2)=3, a(3)=5; a(n) = largest prime < a(n-1)+a(n-2)+a(n-3).

Original entry on oeis.org

2, 3, 5, 7, 13, 23, 41, 73, 131, 241, 443, 811, 1493, 2741, 5039, 9257, 17033, 31327, 57601, 105953, 194869, 358417, 659237, 1212521, 2230159, 4101907, 7544573, 13876601, 25523011, 46944179, 86343787, 158810947, 292098907, 537253631
Offset: 1

Views

Author

Zak Seidov, Mar 03 2007

Keywords

Crossrefs

Cf. A055501.

Programs

  • Maple
    f:= proc(n) option remember; prevprime(procname(n-1)+procname(n-2)+procname(n-3)) end proc:
    f(1):= 2: f(2):= 3: f(3):= 5:
    map(f, [$1..100]); # Robert Israel, Mar 12 2018
  • Mathematica
    nxt[{a_,b_,c_}]:={b,c,NextPrime[a+b+c,-1]}; NestList[nxt,{2,3,5},40][[All,1]] (* Harvey P. Dale, Jun 09 2018 *)