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

a(n) is the number of monic polynomials of degree n over GF(11) without linear factors.

0

`%I #14 Sep 07 2022 11:12:16
`

`%S 0,0,55,440,5170,56408,620950,6830120,75131485,826446280,9090909091,
`

`%T 100000000000,1100000000000,12100000000000,133100000000000,
`

`%U 1464100000000000,16105100000000000,177156100000000000,1948717100000000000,21435888100000000000,235794769100000000000
`

`%N a(n) is the number of monic polynomials of degree n over GF(11) without linear factors.
`

`%F O.g.f. (1 - z)^(11)/(1-11*z) - 1
`

`%e a(0) = 0 since there are no irreducible constant polynomials (as GF(11) is a field).
`

`%e a(1) = 0 since all polynomials of degree 1 have linear factors.
`

`%e a(2), the number of quadratic polynomials without linear factors, then coincides with the number of irreducible quadratics in GF(11), which is known to be M(11,2), where M(a,d) is the necklace polynomial, so a(2) = 55.
`

`%t necklacePolynomial[q_, n_] :=
`

`%t necklacePolynomial[q, n] = (1/n)*
`

`%t DivisorSum[n, MoebiusMu[n/#1]*q^#1 & ];
`

`%t numIrreds[q_, n_] := If[n != 0, necklacePolynomial[q, n], 0];
`

`%t restrictedPolynomialsOGF[q_, n_, d_] :=
`

`%t Product[(1 - z^If[ArrayDepth[d[[l]]] == 0, d[[l]], d[[l]][[1]]])^
`

`%t If[ArrayDepth[d[[l]]] == 0, numIrreds[q, d[[l]]],
`

`%t d[[l]][[2]]], {l, 1, Length[d]}]/(1 - q*z);
`

`%t numRestrictedPolys[q_, n_, d_] :=
`

`%t SeriesCoefficient[restrictedPolynomialsOGF[q, n, d], {z, 0, n}];
`

`%t q = 11;
`

`%t TableForm[{#, numRestrictedPolys[q, #, {1}]} & /@ (Range[20]),
`

`%t TableHeadings -> {{Row[{"(q=", q, ")"}]}, {"n", "#rootless monics"}}]
`

`%Y Cf. A355510.
`

`%K nonn
`

`%O 0,3
`

`%A _Greyson C. Wesley_, Jul 04 2022
`