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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257799 Parity of binary weight of each term in the infinite trunk of inverted binary beanstalk: a(n) = A010060(A233271(n)). 2
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 (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) = A010060(A233271(n)).

PROG

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

CROSSREFS

Cf. A010060, A233271, A257800.

Sequence in context: A204549 A204437 A286419 * A089496 A182067 A196147

Adjacent sequences:  A257796 A257797 A257798 * A257800 A257801 A257802

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 15 20:49 EDT 2018. Contains 313779 sequences. (Running on oeis4.)