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.

A096225 a(0) = 1; for n >= 0, a(n+1) = smallest prime factor of a(n)! + 1.

Original entry on oeis.org

1, 2, 3, 7, 71, 6653, 25469, 15750503
Offset: 0

Views

Author

N. J. A. Sloane, Aug 09 2004

Keywords

Examples

			71!+1 is the product of 6653 and a large prime.
		

Crossrefs

Programs

  • Mathematica
    a[1] = 2; a[n_] := Block[{p = PrimePi[a[n - 1]] + 1, r = a[n - 1]! + 1}, While[ Mod[r, Prime[p]] != 0, p++ ]; Prime[p]]; Do[ Print[ a[n]], {n, 7}] (* Robert G. Wilson v, Aug 12 2004 *)
    NestList[FactorInteger[#!+1][[1,1]]&,1,7] (* Harvey P. Dale, Sep 20 2016 *)

Extensions

a(6) and a(7) from Robert G. Wilson v, Aug 12 2004