A058946 Coefficients of monic irreducible polynomials over GF(7) listed in lexicographic order.

10, 11, 12, 13, 14, 15, 16, 101, 102, 104, 113, 114, 116, 122, 123, 125, 131, 135, 136, 141, 145, 146, 152, 153, 155, 163, 164, 166, 1002, 1003, 1004, 1005, 1011, 1016, 1021, 1026, 1032, 1035, 1041, 1046, 1052, 1055, 1062, 1065, 1101, 1103, 1112, 1115

Offset: 1

Author

N. J. A. Sloane, Jan 13 2001

Keywords

• nonn
• easy
• nice

Comments

Church's table extends through degree 3.

References

• R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, 1983, Table C, pp. 560-562.

Links

• T. D. Noe, Table of n, a(n) for n=1..728 (through degree 4)
• R. Church, Tables of irreducible polynomials for the first four prime moduli, Annals Math., 36 (1935), 198-209.

Crossrefs

Cf. A058943, A058944, A058945, A058947.

Irreducible over GF(2), GF(3), GF(4), GF(5), GF(7): A058943, A058944, A058948, A058945, this sequence. Primitive irreducible over GF(2), GF(3), GF(4), GF(5), GF(7): A058947, A058949, A058952, A058950, A058951.

Programs

Mathematica

A058946 = Union[ Reap[ Do[ a = Reverse[ IntegerDigits[n, 7]]; b = {0}; la = Length[a]; k = 1; While[k < la + 1, b = Append[b, a[[k]]*x^(k - 1)]; k++]; b = Plus @@ b; c = Factor[b, Modulus -> 7]; id = IntegerDigits[n, 7]; If[b == c && (id == {1, 0} || id[[-1]] != 0), Sow[ FromDigits[id]]], {n, 7, 450}]][[2, 1]]](* Jean-François Alcover, Feb 13 2012, after A058943 *)

Extensions

More terms from David Wasserman, May 23 2002