A101623 Modular binomial transform of 10^n.

1, 1, 11, 1, 111, 101, 1011, 1, 10111, 10101, 111011, 10001, 1100111, 1000101, 10001011, 1, 100010111, 100010101, 1100111011, 100010001, 11101100111, 10101000101, 101110001011, 100000001, 1011000010111, 1010000010101

Offset

0,3

Comments

A101624 in binary.

Links

Table of n, a(n) for n=0..25.

Formula

a(n)=sum{k=0..floor(n/2), mod(binomial(n-k, k), 2)*10^k}.

a(n)=sum{k=0..n, mod(binomial(k, n-k), 2)10^(n-k)};

Crossrefs

Sequence in context: A290420 A278952 A120449 * A336036 A280330 A279937

Adjacent sequences: A101620 A101621 A101622 * A101624 A101625 A101626

Keyword

easy,nonn

Author

Paul Barry, Dec 10 2004

Status

approved