This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A054661 #27 Jul 02 2025 16:01:59 %S A054661 1,0,5,12,51,160,585,2016,7280,26112,95325,349180,1290555,4792320, %T A054661 17895679,67104768,252645135,954422560,3616814565,13743842916, %U A054661 52357696365,199911014400,764877654105,2932030307680,11258999068416 %N A054661 Number of monic irreducible polynomials over GF(4) with zero trace. %C A054661 Also number of Lyndon words of length n with trace 0 over GF(4). %H A054661 F. Ruskey, <a href="http://combos.org/Tpoly">Number of monic irreducible polynomials over GF(q) with given trace</a> %H A054661 F. Ruskey, <a href="http://combos.org/TlyndonFk">Number of Lyndon words over GF(q) with given trace</a> %F A054661 From _Andrey Zabolotskiy_, Dec 17 2020: (Start) %F A054661 a(n) = A074031(n) + 3 * A074032(n). %F A054661 a(n) = A074446(n) + 3 * A074447(n). (End) %Y A054661 Cf. A000048, A051841, A046211, A046209, A054660, A074031, A074032, A074446, A074447. %K A054661 nonn,easy %O A054661 1,3 %A A054661 _N. J. A. Sloane_, Apr 18 2000 %E A054661 More terms from _James Sellers_, Apr 19 2000