id:A091460 - OEIS Search Results

Search: id:A091460

Displaying 1-1 of 1 results found.

page 1

Greatest size of an arithmetic progression contained as substrings in binary representation of n.

+0
5

1, 1, 3, 2, 3, 3, 4, 2, 3, 3, 3, 4, 5, 4, 4, 2, 3, 3, 3, 5, 3, 3, 4, 4, 5, 5, 4, 4, 5, 4, 4, 2, 3, 3, 3, 5, 3, 3, 5, 5, 3, 3, 3, 4, 7, 4, 4, 4, 5, 5, 5, 5, 7, 4, 4, 4, 5, 5, 4, 4, 5, 4, 4, 2, 3, 3, 3, 5, 3, 3, 5, 5, 3, 3, 3, 6, 5, 7, 5, 5, 3, 3, 3, 6, 3, 3, 4, 4, 7, 7, 4, 4, 8, 4, 4, 4, 5, 5, 5, 5, 5, 7 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`a(n) <= A078822(n);` `a(A091461(n))=n and a(m)<>n for m<A091461(n).`
	LINKS	`Index entries for sequences related to binary expansion of n`
	EXAMPLE	`n=28->'11100', {0+k1: 0<=k<a(28)=5}: bbbb0 => bb1bb => bb10b => b11bb => bb100;` `n=29->'11101', {1+k2: 0<=k<a(29)=4}: bbbb1 => b11bb => bb101 => 111bb.`
	CROSSREFS	`Cf. A078822, A007088.` `Sequence in context: A086920 A117451 A130970 this_sequence A035093 A061266 A111114` `Adjacent sequences: A091457 A091458 A091459 this_sequence A091461 A091462 A091463`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jan 12 2004`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research