login
Reducible polynomials over GF(2) in binary format.
1

%I #6 Mar 31 2012 14:02:20

%S 100,101,110,1000,1001,1010,1100,1110,1111,10000,10001,10010,10100,

%T 10101,10110,10111,11000,11010,11011,11100,11101,11110,100000,100001,

%U 100010,100011,100100,100110,100111,101000,101010,101011,101100

%N Reducible polynomials over GF(2) in binary format.

%H A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a>

%H <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a>

%Y a(n) = A007088(A091242(n)). Cf. A058943.

%K nonn

%O 1,1

%A _Antti Karttunen_, Jan 03 2004