|
| |
|
|
A073944
|
|
a(n) = smallest m such that n-th prime divides m! + 1.
|
|
4
| |
|
|
1, 2, 4, 3, 5, 12, 16, 9, 14, 18, 30, 36, 40, 21, 23, 52, 15, 8, 18, 7, 72, 23, 13, 88, 96, 100, 6, 106, 86, 112, 63, 65, 16, 16, 50, 150, 156, 81, 166, 172, 89, 180, 95, 102, 196, 99, 210, 222, 61, 228, 64, 210, 240, 97, 31, 131, 9, 93, 40, 280, 282, 45, 63, 220, 312
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| By Wilson's theorem, a(n)<prime(n). Sequence A115092 gives the number of m such that prime(n) divides m!+1. - T. D. Noe (noe(AT)sspectra.com), Mar 01 2006, Jan 10 2009
Essentially the same as A072937. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 23 2008]
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..2000
|
|
|
MATHEMATICA
| Table[p=Prime[i]; m=1; While[m<p && Mod[m!+1, p]>0, m++ ]; m, {i, 100}] - T. D. Noe (noe(AT)sspectra.com), Mar 01 2006
|
|
|
CROSSREFS
| Cf. A038507.
Sequence in context: A100834 A100826 A093416 * A072937 A129509 A015049
Adjacent sequences: A073941 A073942 A073943 * A073945 A073946 A073947
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Nov 13 2002
|
| |
|
|
