|
Search: id:A074710
|
|
|
| A074710 |
|
Numbers n such that x^n + x^2 + 1 is a primitive irreducible polynomial over GF(2). |
|
+0
2
|
|
| 1, 3, 5, 11, 21, 29, 35, 93, 123, 333, 845
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The next candidate is 4125.
|
|
REFERENCES
|
I. F. Blake, S. Gao and R. J. Lambert, "Constructive problems for irreducible polynomials over finite fields", in Information Theory and Applications, LNCS 793, Springer-Verlag, Berlin, 1994, 1-23, See Table 2.
|
|
LINKS
|
Index entries for sequences related to trinomials over GF(2)
|
|
CROSSREFS
|
Cf. A002475. Agrees with A057460 as far as it goes, but is a different sequence.
Sequence in context: A118037 A094588 A082713 this_sequence A057460 A045515 A122997
Adjacent sequences: A074707 A074708 A074709 this_sequence A074711 A074712 A074713
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Richard Brent, Sep 05 2002
|
|
|
Search completed in 0.002 seconds
|
