%I #7 Mar 30 2012 17:28:44
%S 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,
%T 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,
%U 3,5,2,2,3,2,2,2,1,1,4,0,0,1,1,1,2,1,1,5
%N a(2) = 0, a(3k) = a(3k+1) = a(2k), a(3k+2) = a(2k+1) + 1 for k >= 1.
%H Joseph Myers, <a href="/A205593/b205593.txt">Table of n, a(n) for n = 2..1000</a>
%H <a href="http://www.bmoc.maths.org/home/bmo2-2012.pdf">2011/12 British Mathematical Olympiad Round 2</a>, Problem 2.
%F a(n) = log_2(A205592(n)).
%Y Cf. A205591, A205592, A205594, A205595, A205596.
%K easy,nonn
%O 2,7
%A _Joseph Myers_, Jan 29 2012