|
Search: id:A065027
|
|
|
| A065027 |
|
a(n) = smallest m>0 such that n^m < m!. |
|
+0
4
|
|
| 2, 4, 7, 9, 12, 14, 17, 20, 22, 25, 28, 30, 33, 36, 38, 41, 44, 47, 49, 52, 55, 57, 60, 63, 65, 68, 71, 73, 76, 79, 82, 84, 87, 90, 92, 95, 98, 101, 103, 106, 109, 111, 114, 117, 119, 122, 125, 128, 130, 133, 136, 138, 141, 144, 147, 149, 152, 155, 157, 160, 163
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Differences are 2 or 3 (see A065067). The limit as n -> infinity of f(n)/n is e. - Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 05 2001. [Apparently the Schonbek link cvontains a proof of the first assertion.]
a(10) = 25, a(100) = 269, a(1000) = 2714, a(10000) = 27177, a(10^5) = 271822, see A085830.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
Tomas Schonbek, Title? [From Nikos Apostolakis, Feb 17 2009]
|
|
EXAMPLE
|
2^3 > 3! but 2^4 < 4!, so a(2)=4.
|
|
PROGRAM
|
(PARI) { m=1; for (n=1, 1000, until (n^m < m!, m++); write("b065027.txt", n, " ", m) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 03 2009]
|
|
CROSSREFS
|
Sequence in context: A067839 A047211 A087733 this_sequence A165994 A163293 A026356
Adjacent sequences: A065024 A065025 A065026 this_sequence A065028 A065029 A065030
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com), Nov 02 2001
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 05 2001
|
|
|
Search completed in 0.002 seconds
|
