login
Length of longest non-overlapping repeated subword of n in binary representation.
1

%I #8 Mar 30 2012 18:50:44

%S 0,0,1,1,1,1,1,1,1,2,1,1,1,1,2,1,1,2,1,2,2,2,1,1,1,2,2,1,1,2,2,1,1,2,

%T 1,3,2,2,1,2,2,2,2,2,3,2,2,1,1,2,2,2,2,3,2,1,1,2,2,2,2,2,3,1,1,2,1,3,

%U 2,2,1,3,3,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,3,3,2,3,2,2,1,1,2,2,3,2,3,2,2,2

%N Length of longest non-overlapping repeated subword of n in binary representation.

%C a(A007582(n))=n and a(m)<n for m < A007582(n).

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%Y Cf. A007088.

%K nonn

%O 1,10

%A _Reinhard Zumkeller_, Aug 04 2004