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 #10 Jun 08 2014 13:34:28
%S 0,0,0,1,0,1,0,2,0,1,2,1,0,1,0,3,0,1,2,1,0,3,2,1,0,1,0,2,0,1,0,4,0,1,
%T 2,1,3,1,2,1,0,1,4,1,0,3,2,1,0,1,0,2,0,1,3,2,0,1,0,2,0,1,0,5,0,1,2,1,
%U 3,1,2,1,0,4,2,1,3,1,2,1,0,1,2,1,0,5,2,1,0,1,2,4,0,3,2,1,0,1,0,2,0,1
%N In binary representation: length of longest proper prefix of n, that is also a suffix.
%C a(n) <= A070939(n)-1 by definition;
%C a(2^k-1)=k-1; for k>0: a(2^k+1)=1; for k>2: a(2^k+2)=2;
%C a(A091065(n)) = 0, a(A091066(n)) > 0.
%H Alois P. Heinz, <a href="/A091064/b091064.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%Y Cf. A007088, A242869.
%K nonn,base
%O 0,8
%A _Reinhard Zumkeller_, Dec 17 2003