login
A100741
Inverse modulo 2 binomial transform of 8^n.
0
1, 7, 63, 441, 4095, 28665, 257985, 1805895, 16777215, 117440505, 1056964545, 7398751815, 68702695425, 480918867975, 4328269811775, 30297888682425, 281474976710655, 1970324836974585, 17732923532771265, 124130464729398855
OFFSET
0,2
COMMENTS
8^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)8^k}.
CROSSREFS
Sequence in context: A343137 A188226 A055405 * A043027 A165759 A166153
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Dec 06 2004
EXTENSIONS
Name corrected by N. J. A. Sloane, Dec 20 2019
STATUS
approved