|
| |
|
|
A092427
|
|
Least k > 1 such that k^n divides (k-1)!.
|
|
2
|
|
|
|
2, 6, 12, 12, 12, 24, 24, 36, 40, 45, 48, 60, 60, 60, 72, 72, 72, 80, 80, 90, 90, 120, 120, 120, 120, 120, 120, 120, 144, 144, 144, 144, 144, 144, 144, 180, 180, 180, 180, 180, 180, 180, 180, 180, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
Is 45 the only odd number in this sequence? - Derek Orr, Apr 16 2015
|
|
|
LINKS
|
Michael De Vlieger, Table of n, a(n) for n = 0..1000
|
|
|
FORMULA
|
Does limit n ->infty a(n)/n exist?
|
|
|
MATHEMATICA
|
Table[k = 2; While[Mod[(k - 1)!, k^n] != 0, k++]; k, {n, 0, 60}] (* Michael De Vlieger, Apr 16 2015 *)
|
|
|
PROG
|
(PARI) a(n)=if(n<0, 0, k=2; while((k-1)!%(k^n)>0, k++); k)
|
|
|
CROSSREFS
|
A061770 gives values of n such that a(n) > a(n-1).
Sequence in context: A278232 A074385 A057340 * A058198 A096075 A278256
Adjacent sequences: A092424 A092425 A092426 * A092428 A092429 A092430
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Benoit Cloitre, Mar 22 2004
|
|
|
EXTENSIONS
|
Name edited by Derek Orr, Apr 16 2015
|
|
|
STATUS
|
approved
|
| |
|
|
