login
A100681
Inverse modulo 2 binomial transform of 10^n.
0
1, 9, 99, 891, 9999, 89991, 989901, 8909109, 99999999, 899999991, 9899999901, 89099999109, 999899990001, 8999099910009, 98990099010099, 890910891090891, 9999999999999999, 89999999999999991, 989999999999999901
OFFSET
0,2
COMMENTS
10^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)*a(k)}.
FORMULA
a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)10^k}.
CROSSREFS
Sequence in context: A306449 A160946 A359078 * A043044 A222729 A069000
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Dec 06 2004
EXTENSIONS
Definition and comment corrected by N. J. A. Sloane, Dec 20 2019
STATUS
approved