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.

A055502 a(0)=0, a(1)=2, a(n) = smallest prime > a(n-1)+a(n-2).

Original entry on oeis.org

0, 2, 3, 7, 11, 19, 31, 53, 89, 149, 239, 389, 631, 1021, 1657, 2683, 4349, 7039, 11393, 18433, 29833, 48271, 78121, 126397, 204521, 330943, 535481, 866431, 1401937, 2268377, 3670319, 5938711, 9609031, 15547769, 25156811, 40704589, 65861461, 106566059, 172427531
Offset: 0

Views

Author

N. J. A. Sloane, Jul 09 2000

Keywords

Crossrefs

Programs

  • Maple
    A055502 := proc(n) option remember; if n<=0 then n else nextprime(A055502(n-1)+A055502(n-2)); fi; end;
  • Mathematica
    a[0] = 0; a[1] = 2; a[n_] := a[n] = NextPrime[a[n-1] + a[n-2]]; Array[a, 40, 0] (* Amiram Eldar, Sep 24 2023 *)

Extensions

More terms from Amiram Eldar, Sep 24 2023