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