1,1

a(n) = 0 or 1, chosen so as to maximize the number of different subsequences that are formed.

a(n+1)=1 if and only if (a(1),a(2),...,a(n),0), but not (a(1),a(2),...,a(n),1), has greater length of longest repeated segment than (a(1),a(2),...,a(n)) has.

In Feb, 2003, Alejandro Dau solved Problem 3 on the Unsolved Problems and Rewards website, thus establishing that every binary word occurs infinitely many times in this sequence.

Klaus Sutmer remarks (Jun 26 2006) that this sequence is very similar to the Ehrenfeucht-Mycielski sequence A007061. Both sequences have every finite binary word as a factor; in fact, essentially the same proof works for both sequences.

C. Kimberling, Problem 2289, Crux Mathematicorum 23 (1997) 501.

A. Dau Secuencia Maximizadora de Subcadenas (Interactive Javagenerator of repetition-resistant sequences).

C. Kimberling, Unsolved Problems and Rewards.

a(7)=1 because (0,1,0,0,0,1,0) has repeated segment (0,1,0) of length 3, whereas (0,1,0,0,0,1,1) has no repeated segment of length 3.

Cf. A079136, A079335, A079336, A079337, A079338, A007061.

Sequence in context: A134667 A117943 A096268 this_sequence A076478 A091444 A091447

Adjacent sequences: A079098 A079099 A079100 this_sequence A079102 A079103 A079104

nonn

Clark Kimberling (ck6(AT)evansville.edu), Jan 03 2003