login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Modular binomial transform of 10^n.
1

%I #4 Mar 30 2012 18:59:02

%S 1,1,11,1,111,101,1011,1,10111,10101,111011,10001,1100111,1000101,

%T 10001011,1,100010111,100010101,1100111011,100010001,11101100111,

%U 10101000101,101110001011,100000001,1011000010111,1010000010101

%N Modular binomial transform of 10^n.

%C A101624 in binary.

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

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

%K easy,nonn

%O 0,3

%A _Paul Barry_, Dec 10 2004