A054661 - OEIS

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

A054661

Number of monic irreducible polynomials over GF(4) with zero trace.

7

1, 0, 5, 12, 51, 160, 585, 2016, 7280, 26112, 95325, 349180, 1290555, 4792320, 17895679, 67104768, 252645135, 954422560, 3616814565, 13743842916, 52357696365, 199911014400, 764877654105, 2932030307680, 11258999068416

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

Also number of Lyndon words of length n with trace 0 over GF(4).

LINKS

Table of n, a(n) for n=1..25.

F. Ruskey, Number of monic irreducible polynomials over GF(q) with given trace

F. Ruskey, Number of Lyndon words over GF(q) with given trace

FORMULA

From Andrey Zabolotskiy, Dec 17 2020: (Start)

a(n) = A074031(n) + 3 * A074032(n).

a(n) = A074446(n) + 3 * A074447(n). (End)

CROSSREFS

Cf. A000048, A051841, A046211, A046209, A054660, A074031, A074032, A074446, A074447.

Sequence in context: A240389 A135769 A074024 * A188118 A062978 A189421

Adjacent sequences: A054658 A054659 A054660 * A054662 A054663 A054664

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Apr 18 2000

EXTENSIONS

More terms from James A. Sellers, Apr 19 2000

STATUS

approved