|
Search: id:A133481
|
|
|
| A133481 |
|
a(n) = least k such that k^n divides k!. |
|
+0
4
|
|
| 1, 6, 15, 18, 12, 32, 24, 36, 40, 45, 48, 100, 84, 60, 154, 165, 72, 96, 80, 126, 90, 135, 286, 200, 312, 264, 168, 120, 297, 189, 160, 330, 544, 210, 144, 224, 300, 385, 396, 324, 252, 680, 350, 180, 280, 748, 572, 486, 400, 405, 315, 528, 320, 336, 450, 512, 288, 240, 715
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Least k such that A011776(k)=n.
|
|
REFERENCES
|
Ivan Niven, Herbert S. Zuckerman and Hugh L. Montgomery, An Introduction to the Theory Of Numbers, Fifth Edition, John Wiley and Sons, Inc., NY 1991.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 251.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..345
Index entries for sequences related to factorial numbers
|
|
EXAMPLE
|
a(7)=24 because 24^7|24! and smaller numbers than 24 do not divide their factorials 7 times.
|
|
CROSSREFS
|
Cf. A011776, A011777, A011778.
Sequence in context: A114812 A139204 A122661 this_sequence A099535 A070999 A128693
Adjacent sequences: A133478 A133479 A133480 this_sequence A133482 A133483 A133484
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Masahiko Shin (nin-ts5406(AT)w9.dion.ne.jp), Nov 29 2007
|
|
EXTENSIONS
|
Edited by njas using material from A011777, Nov 29 2007
|
|
|
Search completed in 0.002 seconds
|
