cp's OEIS Frontend

A091064 In binary representation: length of longest proper prefix of n, that is also a suffix.

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