|
Search: id:A011777
|
|
|
| A011777 |
|
a(n) = least k>1 such that k^n divides k!. |
|
+0
4
|
|
| 2, 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,1
|
|
|
COMMENT
|
For n >= 2, 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
|
|
CROSSREFS
|
See A133481 for a better version. Cf. A011776, A011778.
Sequence in context: A119416 A134891 A020947 this_sequence A129631 A014847 A013636
Adjacent sequences: A011774 A011775 A011776 this_sequence A011778 A011779 A011780
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com)
|
|
|
Search completed in 0.002 seconds
|
