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 A272033 #13 Apr 20 2016 00:26:05 %S A272033 0,0,0,1,0,1,0,9,2,19,6,76,0,157,113,1031,0,2506,0,13321,4204,35246, %T A272033 3924,158464,21623,430391,283774,1854971,52648,5553234,0,33556537, %U A272033 18428119,83562231,18807137,436801680,8328278,1205614037 %N A272033 Number of irreducible normal polynomials of degree n over GF(2) that are not primitive. %H A272033 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 42.6.3 "The number of binary normal bases", pp. 904-907. %H A272033 Joerg Arndt, <a href="http://jjj.de/fxt/demo/gf2n/#all-normalpoly">C++ program used for computing this sequence</a> %F A272033 a(n) = A027362(n) - A107222(n). %F A272033 a(n) = 0 if 2^n - 1 is prime. %Y A272033 Cf. A027362 (primitive normal polynomials), A107222. %K A272033 nonn %O A272033 1,8 %A A272033 _Joerg Arndt_, Apr 18 2016