A257799 Parity of binary weight of each term in the infinite trunk of inverted binary beanstalk: a(n) = A010060(A233271(n)).

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

Offset

0

Links

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

Formula

a(n) = A010060(A233271(n)).

Prog

(Scheme) (define (A257799 n) (A010060 (A233271 n)))

Crossrefs

Cf. A010060, A233271, A257800.

Sequence in context: A204437 A080110 A286419 * A089496 A182067 A196147

Adjacent sequences: A257796 A257797 A257798 * A257800 A257801 A257802

Keyword

nonn

Author

Antti Karttunen, May 12 2015

Status

approved