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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A300675 Number of monic irreducible polynomials of degree n over GF(16) that have a given nonzero trace. 2
1, 8, 85, 1024, 13107, 174760, 2396745, 33554432, 477218560, 6871947672, 99955602525, 1466015503360, 21651921285435, 321685687669320, 4803839602524143, 72057594037927936, 1085102592571150095, 16397105843297320960, 248545604361560274405, 3777893186295716170752, 57567896172125197996605 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A299176 A093103 A288691 * A241323 A349334 A261501
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 11 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)