This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183163 Least integer k such that floor(k*log(n+1))>k*log(n). 5
 2, 1, 3, 2, 3, 5, 1, 6, 4, 3, 5, 2, 5, 3, 4, 5, 6, 10, 18, 1, 11, 8, 6, 5, 4, 7, 10, 3, 5, 7, 9, 15, 2, 11, 7, 5, 8, 14, 3, 10, 7, 4, 9, 5, 11, 6, 7, 8, 10, 12, 15, 21, 34, 1, 40, 24, 17, 13, 11, 10, 8, 7, 13, 6, 11, 5, 14, 9, 17, 4, 11, 7, 10, 13, 22, 3, 17 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Equivalently, a(n) is the least integer k for which there is an integer J such that n^k < e^J < (n+1)^k; or, equivalently, such that there is a rational number H with denominator k for which log(n) < H < log(n+1). LINKS MATHEMATICA Table[k=1; While[Floor[k*Log[n+1]] <= k*Log[n], k++]; k, {n, 100}] PROG (Sage) A183163 = lambda n: next(k for k in IntegerRange(1, infinity) if floor(k*log(n+1)) > k*log(n)) # [D. S. McNeil, Dec 28 2010] CROSSREFS Cf. A183162. Sequence in context: A319320 A305194 A303362 * A122545 A072515 A318747 Adjacent sequences:  A183160 A183161 A183162 * A183164 A183165 A183166 KEYWORD nonn AUTHOR Clark Kimberling, Dec 27 2010 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 July 22 08:31 EDT 2019. Contains 325216 sequences. (Running on oeis4.)