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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A169914 Number of reducible Boolean polynomials of degree n with constant term 1. 2

%I #6 Mar 30 2012 17:38:11

%S 0,0,1,1,3,7,13,25,51,88,189,342,624,1194,2236,4016,7439,13670,24645,

%T 44928,81975,145655,264123,474559,840087,1512866,2694988,4753010,

%U 8444560,14974404,26399897,46674734,82093547,143885839,253182860,445087238,776524791,1362148377,2382166685

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

%C See A169912 for details.

%H <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>

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

%Y Cf. A169912, A169913.

%K nonn

%O 0,5

%A _David Applegate_, _Marc LeBrun_ and _N. J. A. Sloane_, Jul 11 2010

%E More terms from _David Applegate_, Jul 19 2010

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 07:22 EDT 2024. Contains 371922 sequences. (Running on oeis4.)