|
%I #3 Mar 30 2012 18:59:02
%S 1,-1,9,1,89,-99,991,-1,9909,-9899,88991,9999,899911,-999901,9999009,
%T 1,99990089,-99990099,899910991,99989999,8899099911,-9898999901,
%U 99089999009,-99999999,990999990091,-989999990101,8899999911009,999999990001,89999999100089,-99999999000099
%N A modular binomial transform of 10^n.
%C a(2^n-1)=(-1)^n.
%F a(n)=sum{k=0..floor(n/2), (-1)^A010060(n-2k)*mod(binomial(n-k, k), 2)10^k}
%Y Cf. A101679.
%K easy,sign
%O 0,3
%A _Paul Barry_, Dec 11 2004
|
