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.

Showing 1-3 of 3 results.

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

A079525 Erroneous version of A064164 given in the reference.

Original entry on oeis.org

8, 9, 13, 14, 15, 16, 17, 18, 19, 22
Offset: 1

Views

Author

Keywords

References

  • G. E. Hardy and M. V. Subbarao, A modified problem of Pillai and some related questions, Amer. Math. Monthly 109 (2002), no. 6, 554-559.

A064295 Numbers k such that every (prime) factor of k!+1 is one more than a multiple of k.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 25, 27, 28, 37, 41, 46, 73, 77, 116
Offset: 1

Views

Author

Don Reble, Sep 25 2001

Keywords

Comments

a(20) >= 140. - Max Alekseyev, Feb 19 2024

Examples

			46 is in the list because 46!+1 = 47 * 268662306503771535067 * 435777793891607546778854755077304349 and all of those factors are = 1 mod 46.
		

Crossrefs

Complement of A064164, superset of A002981.

Extensions

a(19) from Amiram Eldar, Oct 03 2019
Showing 1-3 of 3 results.