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.

A169914 Number of reducible Boolean polynomials of degree n with constant term 1.

Original entry on oeis.org

0, 0, 1, 1, 3, 7, 13, 25, 51, 88, 189, 342, 624, 1194, 2236, 4016, 7439, 13670, 24645, 44928, 81975, 145655, 264123, 474559, 840087, 1512866, 2694988, 4753010, 8444560, 14974404, 26399897, 46674734, 82093547, 143885839, 253182860, 445087238, 776524791, 1362148377, 2382166685
Offset: 0

Views

Author

Keywords

Comments

See A169912 for details.

Crossrefs

Formula

a(n) = A169913(n) - 2^(n-1) for n >= 2.

Extensions

More terms from David Applegate, Jul 19 2010