|
Search: id:A057460
|
|
|
| A057460 |
|
Numbers n such that x^n + x^2 + 1 is irreducible over GF(2). |
|
+0
3
|
|
| 1, 3, 5, 11, 21, 29, 35, 93, 123, 333, 845, 4125, 10437, 10469, 14211, 20307, 34115, 47283, 50621, 57341
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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
|
Joerg Arndt, Fxtbook
Index entries for sequences related to trinomials over GF(2)
|
|
MATHEMATICA
|
Do[ If[ ToString[ Factor[ x^n + x^2 + 1, Modulus -> 2 ] ] == ToString[ x^n + x^2 + 1 ], Print[ n ] ], {n, 0, 750} ]
|
|
CROSSREFS
|
Cf. A002475, A074710.
Sequence in context: A094588 A082713 A074710 this_sequence A093328 A045515 A146787
Adjacent sequences: A057457 A057458 A057459 this_sequence A057461 A057462 A057463
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 27 2000
|
|
EXTENSIONS
|
More terms from Richard Brent, Sep 05, 2002
|
|
|
Search completed in 0.002 seconds
|
