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!)
A300674 Number of monic irreducible polynomials of degree n over GF(8) that have a given nonzero trace. 2
1, 4, 21, 128, 819, 5460, 37449, 262144, 1864128, 13421772, 97612893, 715827840, 5286113595, 39268272420, 293203100463, 2199023255552, 16557351571215, 125099989647360, 948126237341157, 7205759403792768, 54901024028884989, 419244183493398900, 3208129404123400281, 24595658764945981440 (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/(8*n)) * Sum_{odd d divides n} mu(d)*8^(n/d), where mu is the Möbius function A008683.
MATHEMATICA
a[n_] := DivisorSum[n, MoebiusMu[#] * 8^(n/#) &, OddQ[#] &] / (8*n); Array[a, 24] (* Amiram Eldar, Oct 04 2023 *)
PROG
(PARI) a(n) = sumdiv(n, d, if (d%2, moebius(d)*8^(n/d)))/(8*n); \\ Michel Marcus, Mar 11 2018
CROSSREFS
Sequence in context: A255673 A099250 A293192 * A371430 A232956 A234268
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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)