id:A093692 - OEIS Search Results

Search: id:A093692

Displaying 1-1 of 1 results found.

page 1

a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 2).

+0
3

0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`A "substrings maximizer sequence" (or SMS) in base 2.`
	CROSSREFS	`See A093691 for more information.` `Cf. A093691, A093693, A079101, A038219, A080415.` `Adjacent sequences: A093689 A093690 A093691 this_sequence A093693 A093694 A093695` `Sequence in context: A095130 A030301 A071981 this_sequence A105384 A057212 A023959`
	KEYWORD	`nonn`
	AUTHOR	`Alejandro V. Dau (ad1n(AT)dc.uba.ar), Apr 11 2004`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research