login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257800 Sequence A233271 reduced modulo 2: a(n) = A000035(A233271(n)); the parity of each term in the infinite trunk of inverted binary beanstalk. 9
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 18:03 EST 2019. Contains 329809 sequences. (Running on oeis4.)