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.

A064229 Smallest prime p associated with A064164(n).

Original entry on oeis.org

61, 71, 83, 23, 59, 61, 661, 23, 71, 20639383, 439429, 521, 79, 811, 1697, 14557, 1080941, 257, 2281, 50989, 67411, 137, 83, 14029308060317546154181, 57554485363, 59, 70552493296669, 59, 694763, 293, 6007711, 12893, 1021, 149, 71, 24324571, 9293, 12318573951317236818169524329
Offset: 1

Views

Author

N. J. A. Sloane, Sep 23 2001

Keywords

Examples

			8!+1 = 61*661 and 61 is not 1 mod 8, so the first term is 61.
		

Programs

  • PARI
    choose(n) = {my(f=factor(n!+1)[, 1]); for(i=1, #f, if(f[i]%n != 1, return(f[i]))); 0; }
    lista(nn) = for(k=1, nn, if(choose(k)>1, print1(choose(k), ", "))); \\ Jinyuan Wang, Oct 03 2019

Extensions

More terms from Don Reble, Sep 23 2001