|
| |
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
10^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)*a(k)}.
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)10^k}.
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
