A097295 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A097295

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

1

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,10

COMMENTS

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

LINKS

Table of n, a(n) for n=1..105.

Index entries for sequences related to binary expansion of n

CROSSREFS

Sequence in context: A063014 A286361 A357849 * A220572 A083896 A332083

Adjacent sequences: A097292 A097293 A097294 * A097296 A097297 A097298

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Aug 04 2004

STATUS

approved