login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A300675
Number of monic irreducible polynomials of degree n over GF(16) that have a given nonzero trace.
3
1, 8, 85, 1024, 13107, 174760, 2396745, 33554432, 477218560, 6871947672, 99955602525, 1466015503360, 21651921285435, 321685687669320, 4803839602524143, 72057594037927936, 1085102592571150095, 16397105843297320960, 248545604361560274405, 3777893186295716170752, 57567896172125197996605
OFFSET
1,2
LINKS
F. Ruskey, C.R. Miers, and J. Sawada, The number of irreducible polynomials and Lyndon words with given trace, SIAM J. Discrete Math. 14 (2001), 240-245.
FORMULA
a(n) = (1/(16*n)) * Sum_{odd d divides n} mu(d)*16^(n/d), where mu is the Möbius function A008683.
MATHEMATICA
a[n_] := DivisorSum[n, MoebiusMu[#] * 16^(n/#) &, OddQ[#] &] / (16*n); Array[a, 21] (* Amiram Eldar, Oct 04 2023 *)
PROG
(PARI) a(n) = sumdiv(n, d, if (d%2, moebius(d)*16^(n/d)))/(16*n); \\ Michel Marcus, Mar 11 2018
CROSSREFS
Column 16 of A110540.
Sequence in context: A299176 A093103 A288691 * A241323 A349334 A261501
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 11 2018
STATUS
approved