|
| |
|
|
A101680
|
|
A modular binomial transform of 10^n.
|
|
0
|
|
|
|
1, 11, 111, 1011, 10111, 111011, 1100111, 10001011, 100010111, 1100111011, 11101100111, 101110001011, 1011000010111, 11100000111011, 110000001100111, 1000000010001011, 10000000100010111, 110000001100111011
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n)=sum{k=0..n, mod(binomial(2n-k, k), 2)10^k}
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
