id:A097295 - OEIS Search Results

Search: id:A097295

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,10`
	COMMENT	`a(A007582(n))=n and a(m)<n for m<A007582(n).`
	LINKS	`Index entries for sequences related to binary expansion of n`
	CROSSREFS	`Cf. A007088.` `Sequence in context: A093997 A157196 A063014 this_sequence A083896 A084115 A080028` `Adjacent sequences: A097292 A097293 A097294 this_sequence A097296 A097297 A097298`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 04 2004`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research