|
%I #9 Dec 20 2019 17:33:23
%S 1,9,99,891,9999,89991,989901,8909109,99999999,899999991,9899999901,
%T 89099999109,999899990001,8999099910009,98990099010099,
%U 890910891090891,9999999999999999,89999999999999991,989999999999999901
%N Inverse modulo 2 binomial transform of 10^n.
%C 10^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)*a(k)}.
%F a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)10^k}.
%K easy,nonn
%O 0,2
%A _Paul Barry_, Dec 06 2004
%E Definition and comment corrected by _N. J. A. Sloane_, Dec 20 2019
|
