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!)
A099396 a(n) = floor(log_2(2/3*n)) for n >= 2, a(1) = 0. 3
0, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
G.f.: (1/(1-x)) * Sum_{k>=0} x^(3*2^k).
MAPLE
0, seq(ilog2(2/3*n), n=2..110); # Georg Fischer, Aug 31 2021
MATHEMATICA
Join[{0}, Floor[Log[2, 2/3 Range[2, 110]]]] (* Harvey P. Dale, Mar 01 2012 *)
CROSSREFS
First differences are in A099395. Cf. A004762, A007283.
Sequence in context: A080342 A081604 A123119 * A126235 A220104 A191228
KEYWORD
nonn
AUTHOR
Ralf Stephan, Oct 21 2004
EXTENSIONS
Definition corrected by Georg Fischer, Aug 31 2021
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 September 27 20:41 EDT 2023. Contains 365714 sequences. (Running on oeis4.)