A217207 Start with a(1)=0; then a(n) = (curling number of (a(1),...,a(n-1))) mod 2.

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

Offset

1

Links

Table of n, a(n) for n=1..150.

Index entries for sequences related to Gijswijt's sequence

Index entries for sequences related to curling numbers

Crossrefs

Cf. A090822, A217206, A216730 (for definition of curling number).

Sequence in context: A103226 A357298 A080886 * A083924 A171587 A284627

Adjacent sequences: A217204 A217205 A217206 * A217208 A217209 A217210

Keyword

nonn

Author

N. J. A. Sloane, following a suggestion from Russell Sutherland, Sep 28 2012

Status

approved