The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065801 Least k such that n^k > 2^n. 1
 3, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Harry J. Smith, Table of n, a(n) for n = 2..1000 EXAMPLE a(4) = 3 because if k = 2, 4^2 <= 2^4 but when k reaches 3, 4^3 > 2^4. MATHEMATICA a[n_] := (k = 1; While[n^k <= 2^n, k++ ]; Return[k]); Table[ a[n], {n, 2, 70} ] lk[n_]:=Module[{k=Ceiling[Log[n, 2^n]], nt=2^n}, While[n^k<=nt, k++]; k]; Array[ lk, 90, 2] (* Harvey P. Dale, Mar 15 2018 *) PROG (PARI) { for (n=2, 1000, k=1; p=2^n; while (n^k <= p, k++); write("b065801.txt", n, " ", k) ) } \\ Harry J. Smith, Oct 31 2009 CROSSREFS Sequence in context: A120004 A079790 A098726 * A265705 A205237 A086920 Adjacent sequences:  A065798 A065799 A065800 * A065802 A065803 A065804 KEYWORD nonn AUTHOR Robert G. Wilson v, Dec 05 2001 EXTENSIONS Offset changed from 1 to 2 and Definition corrected by Harry J. Smith, Oct 31 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 22 13:41 EST 2020. Contains 331149 sequences. (Running on oeis4.)