login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183200 Least integer k such that floor(k*f(n+1))>k*f(n), where f(n)=log_2 of n. 2
1, 2, 1, 4, 2, 3, 1, 6, 4, 3, 2, 3, 4, 6, 1, 12, 6, 5, 4, 3, 5, 2, 7, 5, 3, 4, 5, 6, 8, 11, 1, 23, 12, 8, 6, 5, 9, 4, 7, 3, 8, 5, 7, 13, 2, 11, 7, 5, 8, 3, 10, 7, 4, 9, 5, 11, 6, 8, 9, 11, 15, 22, 1, 45, 23, 16, 12, 10, 8, 7, 6, 11, 5, 9, 13, 4, 11, 7, 13, 3, 14, 8, 13, 5, 12, 7, 9, 13, 21, 2, 23, 13, 11, 9, 7, 17, 5, 8, 11, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Table[k=1; While[Floor[k*Log[2, n+1]]<=k*Log[2, n], k++]; k, {n, 100}]
CROSSREFS
Cf. A183163.
Sequence in context: A363893 A078458 A033317 * A326732 A305422 A007733
KEYWORD
nonn
AUTHOR
Clark Kimberling, Dec 29 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)