|
| |
|
|
A107222
|
|
Number of primitive normal polynomials of degree n over GF(2).
|
|
2
|
|
|
|
1, 1, 1, 1, 3, 3, 7, 7, 19, 29, 87, 52, 315, 291, 562, 1017, 3825, 2870, 13797, 11255, 23579, 59986, 178259, 103680, 607522, 859849, 1551227, 1815045, 9203747, 5505966, 28629151, 33552327, 78899078, 167112969, 333342388, 267841392, 1848954877, 2411186731
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
COMMENTS
|
No formula for the terms is currently known. [Joerg Arndt, Apr 02 2011]
|
|
|
LINKS
|
Table of n, a(n) for n=1..38.
Joerg Arndt, Matters Computational (The Fxtbook), section 42.6.3 "The number of binary normal bases", pp. 904-907.
Joerg Arndt, C++ program used for computing this sequence
|
|
|
EXAMPLE
|
a(9) = 19 because there are 19 primitive normal polynomials of degree 9 over GF(2).
|
|
|
CROSSREFS
|
Cf. A027362, A135498.
Sequence in context: A146812 A147236 A146599 * A050613 A145940 A147103
Adjacent sequences: A107219 A107220 A107221 * A107223 A107224 A107225
|
|
|
KEYWORD
|
nonn,hard
|
|
|
AUTHOR
|
Joerg Arndt, Jun 08 2005, Oct 15 2005
|
|
|
EXTENSIONS
|
Three more terms added from the Arndt website by N. J. A. Sloane, Feb 22 2008
Terms a(34)..a(38) from Joerg Arndt, Apr 17 2016
|
|
|
STATUS
|
approved
|
| |
|
|
