login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A214449
Least m>0 such that n! <= m^m.
1
1, 2, 3, 3, 4, 5, 6, 6, 7, 8, 9, 10, 10, 11, 12, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 21, 22, 22, 23, 24, 25, 26, 27, 27, 28, 29, 30, 31, 32, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 42, 43, 44, 45, 46, 47, 47, 48, 49, 50, 51, 52
OFFSET
1,2
COMMENTS
Conjecture: this sequence results from A118168 by deleting the first two 1s.
LINKS
EXAMPLE
a(4) = 3 because 2^2 < 4! < 3^3.
MATHEMATICA
Table[m = 1; While[n! > m^m, m++]; m, {n, 1, 100}]
CROSSREFS
Cf. A214046.
Sequence in context: A093700 A213854 A366860 * A118168 A083920 A066508
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 18 2012
STATUS
approved