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

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, 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, 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

Offset: 1

Author

Reinhard Zumkeller, Aug 04 2004

Keywords

• nonn

Comments

a(A007582(n))=n and a(m)A007582(n).

Links

• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A007088.