|
Search: id:A063980
|
|
|
| A063980 |
|
Pillai primes: p such that there exists an integer m such that m!+1 is 0 mod p and p is not 1 mod m. |
|
+0
2
|
|
| 23, 29, 59, 61, 67, 71, 79, 83, 109, 137, 139, 149, 193, 227, 233, 239, 251, 257, 269, 271, 277, 293, 307, 311, 317, 359, 379, 383, 389, 397, 401, 419, 431, 449, 461, 463, 467, 479, 499, 503, 521, 557, 563, 569, 571, 577, 593, 599, 601, 607
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..1000
|
|
CROSSREFS
|
Smallest m is given in A063828.
Sequence in context: A108249 A045120 A097436 this_sequence A046124 A157677 A092518
Adjacent sequences: A063977 A063978 A063979 this_sequence A063981 A063982 A063983
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Sep 08 2001
|
|
EXTENSIONS
|
More terms from David W. Wilson, Sep 08, 2001
|
|
|
Search completed in 0.002 seconds
|
