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.

A152446 a(0) = 1. a(1) = 2. For n >= 2, a(n) = the largest prime <= a(n-1)*a(n-2).

Original entry on oeis.org

1, 2, 2, 3, 5, 13, 61, 787, 47981, 37761019, 1811811452611, 68415846686461570603, 123956614566609409301849965194431, 8480596737961958410971738003633556174455988528911421
Offset: 0

Views

Author

Leroy Quet, Dec 04 2008

Keywords

Crossrefs

Cf. A152445.

Programs

  • Mathematica
    a = {1, 2}; Do[AppendTo[a, Prime[PrimePi[a[[ -1]]*a[[ -2]]]]], {9}]; a (* Stefan Steinerberger, Dec 06 2008 *)

Extensions

Extended by Ray Chandler and Stefan Steinerberger, Dec 05 2008