Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Mar 11 2014 01:32:12
%S 1,1,2,1,1,1,1,2,1,1,3,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,3,1,1,
%T 2,1,1,1,1,2,1,1,4,1,1,2,1,1,1,1,2,1,1,3,1,1,2,1,1,1,1,2,1,1,1,1,2,1,
%U 1,1,1,2,1,1,3,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,3,1,1,2,1,1,1,1,2,1
%N Let s(1) = 1; let s(2m+1) = {s(2m),m+1,s(2m)}, s(2m) = {s(2m-1),s(2m-1)}; sequence gives limit of s(k) for large k.
%Y Cf. A080027.
%K nonn,easy
%O 1,3
%A _Leroy Quet_, Feb 07 2003
%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003