|
Search: id:A094802
|
|
|
| A094802 |
|
a(n) = smallest k such that all of 1 through n divides k!. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 5, 7, 7, 7, 7, 11, 11, 13, 13, 13, 13, 17, 17, 19, 19, 19, 19, 23, 23, 23, 23, 23, 23, 29, 29, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 41, 41, 43, 43, 43, 43, 47, 47, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 59, 59
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
It is conjectured that after n=4 the sequence is prime for n prime or the previous prime for n not prime.
|
|
EXAMPLE
|
a(6)=5 as 5!=120 which is divisible by 1,2,3,4,5 and 6.
|
|
PROGRAM
|
(PARI) { for (i=1, 60, x=1; for (j=1, i, xf=x!; if (xf%j!=0, x+=1; j=1)); print1(", "x)) }
|
|
CROSSREFS
|
Cf. A002034, A007917.
Sequence in context: A001414 A134875 A134889 this_sequence A075084 A086593 A073757
Adjacent sequences: A094799 A094800 A094801 this_sequence A094803 A094804 A094805
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Jun 11 2004
|
|
EXTENSIONS
|
Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 02 2006
|
|
|
Search completed in 0.002 seconds
|
