1,1

The next irreducible polynomials of this form up to 10^4 are at n = 2380, 3310, 4495, 6321, 7447. n = 2380 and 3310 are not primitive, so the next term is >= 4495.

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.

N. Zierler, On x^n+x+1 over GF(2). Information and Control 16 1970 502-505.

N. Zierler, Primitive trinomials whose degree is a Mersenne exponent. Information and Control 15 1969 67-69.

N. Zierler and J. Brillhart, On primitive trinomials (mod 2). Information and Control 13 1968 541-554.

N. Zierler and J. Brillhart, On primitive trinomials (mod 2), II. Information and Control 14 1969 566-569.

Joerg Arndt, Fxtbook

R. P. Brent, Searching for primitive trinomials (mod 2)

R. P. Brent, S. Larvala and P. Zimmermann, A fast algorithm for testing reducibility of trinomials ..., Math. Comp. 72 (2003), 1443-1452.

Index entries for sequences related to trinomials over GF(2)

Cf. A002475, A073571, A057486.

Sequence in context: A039947 A096477 A039059 this_sequence A130776 A077292 A036413

Adjacent sequences: A073636 A073637 A073638 this_sequence A073640 A073641 A073642

nonn,nice

Richard Brent and Paul Zimmermann, Sep 05, 2002.