A169914 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A169914

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

2

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

COMMENTS

See A169912 for details.

LINKS

Table of n, a(n) for n=0..38.

Index entries for sequences related to carryless arithmetic

FORMULA

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

CROSSREFS

Cf. A169912, A169913.

Sequence in context: A017994 A218199 A275788 * A078000 A190569 A007909

Adjacent sequences: A169911 A169912 A169913 * A169915 A169916 A169917

KEYWORD

nonn

AUTHOR

David Applegate, Marc LeBrun and N. J. A. Sloane, Jul 11 2010

EXTENSIONS

More terms from David Applegate, Jul 19 2010

STATUS

approved