A257800 Sequence A233271 reduced modulo 2: a(n) = A000035(A233271(n)); the parity of each term in the infinite trunk of inverted binary beanstalk.

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

Offset

0

Links

Antti Karttunen, Table of n, a(n) for n = 0..8727

Formula

a(n) = A000035(A233271(n)).

a(0) = 0; a(1) = 1; and for n > 1, a(n) = 1 - A213729(A218602(n)).

Prog

(Scheme, two variants)
(define (A257800 n) (A000035 (A233271 n)))
(define (A257800 n) (if (< n 2) (A000035 n) (- 1 (A213729 (A218602 n)))))

Crossrefs

Cf. A000035, A213729, A218602, A233271.

Cf. A257803 (positions of ones), A257804 (positions of zeros), A257807 (partial sums).

Cf. also A257799.

Sequence in context: A215531 A305386 A174998 * A284772 A051069 A051065

Adjacent sequences: A257797 A257798 A257799 * A257801 A257802 A257803

Keyword

nonn

Author

Antti Karttunen, May 12 2015

Status

approved