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 A107222 #27 Apr 18 2016 11:26:22 %S A107222 1,1,1,1,3,3,7,7,19,29,87,52,315,291,562,1017,3825,2870,13797,11255, %T A107222 23579,59986,178259,103680,607522,859849,1551227,1815045,9203747, %U A107222 5505966,28629151,33552327,78899078,167112969,333342388,267841392,1848954877,2411186731 %N A107222 Number of primitive normal polynomials of degree n over GF(2). %C A107222 No formula for the terms is currently known. [_Joerg Arndt_, Apr 02 2011] %H A107222 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 A107222 Joerg Arndt, <a href="http://jjj.de/fxt/demo/gf2n/#all-normalpoly">C++ program used for computing this sequence</a> %e A107222 a(9) = 19 because there are 19 primitive normal polynomials of degree 9 over GF(2). %Y A107222 Cf. A027362, A135498. %K A107222 nonn,hard %O A107222 1,5 %A A107222 _Joerg Arndt_, Jun 08 2005, Oct 15 2005 %E A107222 Three more terms added from the Arndt website by _N. J. A. Sloane_, Feb 22 2008 %E A107222 Terms a(34)..a(38) from _Joerg Arndt_, Apr 17 2016