Search: id:A058943 Results 1-1 of 1 results found. %I A058943 %S A058943 10,11,111,1011,1101,10011,11001,11111,100101,101001,101111,110111, %T A058943 111011,111101,1000011,1001001,1010111,1011011,1100001,1100111, %U A058943 1101101,1110011,1110101,10000011,10001001,10001111,10010001 %N A058943 Coefficients of irreducible polynomials over GF(2) listed in lexicographic order. %D A058943 R. Church, Tables of irreducible polynomials for the first four prime moduli, Annals Math., 36 (1935), 198-209. %D A058943 R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, 1983, Table C, pp. 553-555. %H A058943 T. D. Noe, Table of n, a(n) for n=1..1377 (through degree 13) %H A058943 F. Ruskey, Irreducible and Primitive Polynomials over GF(2) %H A058943 Index entries for sequences containing GF(2)[X]-polynomials %e A058943 The first few are x, x+1; x^2+x+1; x^3+x+1, x^3+x^2+1; ... Note that x is irreducible but not primitive. %t A058943 Do[a = Reverse[ IntegerDigits[n, 2]]; b = {0}; l = Length[a]; k = 1; While[k < l + 1, b = Append[b, a[[k]]*x^(k - 1) ]; k++ ]; b = Apply[Plus, b]; c = Factor[b, Modulus -> 2]; If[b == c, Print[ FromDigits[ IntegerDigits[n, 2]]]], {n, 3, 250, 2} ] %Y A058943 Cf. A000020, A001037, A011260, A058944-A058948. %Y A058943 Converted to decimal: A014580. %Y A058943 Irreducible over GF(2), GF(3), GF(4), GF(5), GF(7): this sequence, A058944, A058948, A058945, A058946. Primitive irreducible over GF(2), GF(3), GF(4), GF(5), GF(7): A058947, A058949, A058952, A058950, A058951. %Y A058943 Sequence in context: A035526 A164370 A059458 this_sequence A041217 A041218 A041917 %Y A058943 Adjacent sequences: A058940 A058941 A058942 this_sequence A058944 A058945 A058946 %K A058943 nonn,easy,nice %O A058943 1,1 %A A058943 N. J. A. Sloane (njas(AT)research.att.com), Jan 13 2001 %E A058943 Church's table extends through degree 11. Search completed in 0.001 seconds