A303591 a(n) = 0 if n in A303589, 1 if n is in A303590.

0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1

Offset

0

Links

Table of n, a(n) for n=0..106.

L. Goldberg and A. V. Fraenkel, Patterns in the generalized Fibonacci word, applied to games, Discrete Math., 341 2018 1675-1687. See Example 1.

Crossrefs

Cf. A247844, A303589, A303590.

Sequence in context: A092202 A358846 A285686 * A159684 A244221 A253050

Adjacent sequences: A303588 A303589 A303590 * A303592 A303593 A303594

Keyword

nonn

Author

N. J. A. Sloane, May 23 2018

Status

approved