|
%I #11 Nov 02 2022 16:54:05
%S 1,1,1,2,1,1,4,1,1,2,4,4,2,1,1,4,4,4,8,2,2,2,1,1,8,4,4,8,8,8,4,2,2,4,
%T 1,1,2,8,8,8,4,4,16,8,8,16,4,4,4,2,2,8,1,1,2,2,2,16,8,8,16,4,4,8,16,
%U 16,16,8,8,32,4,4,8,4,4,4,2,2,16,1,1,2,2,2,4
%N a(2) = 1, a(3k) = a(3k+1) = a(2k), a(3k+2) = 2a(2k+1) for k >= 1.
%H Joseph Myers, <a href="/A205592/b205592.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.
%H <a href="/index/O#Olympiads">Index to sequences related to Olympiads and other Mathematical competitions</a>
%F a(n) = A205591(n) - A205591(n-1).
%Y Cf. A205591, A205593, A205594, A205595, A205596.
%Y Cf. A335933.
%K easy,nonn
%O 2,4
%A _Joseph Myers_, Jan 29 2012
|
