A244220 Binary complement of Greedy Catalan Base reduced modulo 2: a(n) = 1 - (A014418(n) modulo 2).

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

Offset

0

Links

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

Formula

a(n) = 1 - A244221(n) = 1 - (A014418(n) modulo 2) = 1 - (A244161(n) modulo 2).

Prog

(Scheme) (define (A244220 n) (- 1 (A244221 n)))
(Python)
from sympy import catalan
def a244160(n):
    if n==0: return 0
    i=1
    while True:
        if catalan(i)>n: break
        else: i+=1
    return i - 1
def a(n):
    if n==0: return 0
    x=a244160(n)
    return 10**(x - 1) + a(n - catalan(x))
print([1 - a(n)%2 for n in range(101)]) # Indranil Ghosh, Jun 08 2017

Crossrefs

Binary complement: A244221.

A244226 gives the lengths of runs of identical terms.

Cf. A014418, A244161.

Sequence in context: A284588 A113704 A341150 * A283963 A131670 A188044

Adjacent sequences: A244217 A244218 A244219 * A244221 A244222 A244223

Keyword

nonn

Author

Antti Karttunen, Jun 23 2014

Status

approved