|
Search: id:A093896
|
|
|
| A093896 |
|
Least k such that n^n divides k!. |
|
+0
3
|
|
| 1, 4, 9, 10, 25, 15, 49, 28, 39, 45, 121, 28, 169, 91, 65, 66, 289, 78, 361, 85, 133, 231, 529, 76, 205, 325, 165, 175, 841, 125, 961, 164, 341, 561, 217, 150, 1369, 703, 481, 165, 1681, 259, 1849, 451, 186, 1035, 2209, 196, 595, 405
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(p) = p^2, p is a prime. a(n) <= n^2.
|
|
MATHEMATICA
|
Do[k = 1; While[Mod[k!, n^n] > 0, k++ ]; Print[k], {n, 1, 30}] (Propper)
|
|
CROSSREFS
|
Cf. A093897.
Sequence in context: A062398 A030754 A077584 this_sequence A113432 A129830 A113434
Adjacent sequences: A093893 A093894 A093895 this_sequence A093897 A093898 A093899
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 23 2004
|
|
EXTENSIONS
|
22 more terms from Ryan Propper (rpropper(AT)stanford.edu), Jun 20 2005
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 12 2006
|
|
|
Search completed in 0.002 seconds
|
