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 #3 Mar 30 2012 18:50:29
%S 1,1,3,2,4,6,6,3,5,8,5,10,8,10,10,4,6,10,9,13,9,12,12,15,10,13,12,15,
%T 13,15,15,5,7,12,11,16,7,16,16,19,11,16,7,19,16,12,19,21,12,16,16,19,
%U 16,19,12,21,16,19,19,21,19,21,21,6,8,14,13,19,12,19,19,23,12,17,16,24
%N Number of distinct binary numbers contained as substrings in binary, circular formed representation of n and not longer than n.
%C For k>0: a(2^k-1)=k, a(2^k)=k+2;
%C for k>1: a(2^k+1)=a(3*2^(k-1))=k+2;
%C for k>0: a(2^k-1)=A078822(2^k-1), a(2^k)=A078822(2^k).
%Y Cf. A078825, A078822, A007088.
%K nonn,base
%O 0,3
%A _Reinhard Zumkeller_, Dec 08 2002