cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A101554 Second inverse mod 2 binomial transform of 2^n.

Original entry on oeis.org

1, 2, 14, 28, 254, 508, 3556, 7112, 65534, 131068, 917476, 1834952, 16645636, 33291272, 233038904, 466077808, 4294967294, 8589934588, 60129542116, 120259084232, 1090921692676, 2181843385352, 15272903697464, 30545807394928
Offset: 0

Views

Author

Paul Barry, Dec 06 2004

Keywords

Comments

Interpolated zeros suppressed.

Formula

a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)A100735(k)}.