The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A175406 The greatest integer k such that (1+1/n)^k <= 2. 2
1, 1, 2, 3, 3, 4, 5, 5, 6, 7, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, 14, 15, 16, 16, 17, 18, 19, 19, 20, 21, 21, 22, 23, 23, 24, 25, 25, 26, 27, 28, 28, 29, 30, 30, 31, 32, 32, 33, 34, 35, 35, 36, 37, 37, 38, 39, 39, 40, 41, 41, 42, 43, 44, 44, 45, 46, 46, 47, 48, 48, 49, 50, 50, 51 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
The sequence of first differences consists of zeros and ones, with no two consecutive zeros and no more than three consecutive ones.
LINKS
FORMULA
a(n) = n log 2 + O(1). Conjecture: a(n) = floor((n + 1/2) log 2). - Charles R Greathouse IV, Apr 03 2012
MATHEMATICA
Table[Floor[Log[(1+1/n), 2]], {n, 200}]
PROG
(PARI) a(n)=log(2)\log(1+1/n) \\ Charles R Greathouse IV, Apr 03 2012
CROSSREFS
Cf. A094500.
Sequence in context: A066481 A248103 A121928 * A210435 A181534 A258703
KEYWORD
nonn
AUTHOR
Zak Seidov, May 01 2010
EXTENSIONS
Name corrected (to match terms) by Jon E. Schoenfield, Apr 23 2014
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 May 13 09:49 EDT 2024. Contains 372504 sequences. (Running on oeis4.)