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!)
A060508 Exponent of largest power of n < 2^n. 1
2, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 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, 8, 9, 9, 9, 9, 9, 9, 9, 10, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
FORMULA
a(n) = floor(n/log(2, n)); n^a(n) <= 2^n <= n^(1+a(n)).
EXAMPLE
For n = 10, 1000 < 1024 < 10000, so a(10) = 3; a(1) is indeterminate, since 1^j < 2^1.
MATHEMATICA
Table[Floor[n/Log[2, n]], {n, 2, 89}] (* Stefano Spezia, Dec 07 2021 *)
CROSSREFS
Sequence in context: A343911 A125688 A230257 * A029404 A029417 A029237
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Apr 11 2001
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 March 29 03:41 EDT 2024. Contains 371264 sequences. (Running on oeis4.)