login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 18:12 EST 2019. Contains 329847 sequences. (Running on oeis4.)