login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205593 a(2) = 0, a(3k) = a(3k+1) = a(2k), a(3k+2) = a(2k+1) + 1 for k >= 1. 6
0, 0, 0, 1, 0, 0, 2, 0, 0, 1, 2, 2, 1, 0, 0, 2, 2, 2, 3, 1, 1, 1, 0, 0, 3, 2, 2, 3, 3, 3, 2, 1, 1, 2, 0, 0, 1, 3, 3, 3, 2, 2, 4, 3, 3, 4, 2, 2, 2, 1, 1, 3, 0, 0, 1, 1, 1, 4, 3, 3, 4, 2, 2, 3, 4, 4, 4, 3, 3, 5, 2, 2, 3, 2, 2, 2, 1, 1, 4, 0, 0, 1, 1, 1, 2, 1, 1, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,7

LINKS

Joseph Myers, Table of n, a(n) for n = 2..1000

2011/12 British Mathematical Olympiad Round 2, Problem 2.

FORMULA

a(n) = log_2(A205592(n)).

CROSSREFS

Cf. A205591, A205592, A205594, A205595, A205596.

Sequence in context: A325406 A257900 A039971 * A277937 A112020 A069160

Adjacent sequences:  A205590 A205591 A205592 * A205594 A205595 A205596

KEYWORD

easy,nonn

AUTHOR

Joseph Myers, Jan 29 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 3 01:39 EDT 2020. Contains 333195 sequences. (Running on oeis4.)