login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058059 Numbers n such that x^n + x + 2 is irreducible over GF(3). 0
2, 4, 6, 14, 30, 40, 54, 364, 446, 638, 1382, 1478, 2726, 5678, 6424, 8524, 15990 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Apparently all terms are even. [Joerg Arndt, Apr 28 2012]

LINKS

Table of n, a(n) for n=1..17.

MATHEMATICA

Select[Range[1000], IrreduciblePolynomialQ[x^# + x + 2, Modulus -> 3] &] (* Robert Price, Sep 19 2018 *)

PROG

(Sage)

P.<x> = GF(3)[]

for n in range(1, 10^4):

    p = (x^n + x + 2);

    if p.is_irreducible():

        print(n)

# Joerg Arndt, Apr 28 2012

CROSSREFS

Sequence in context: A151794 A181528 A251393 * A053686 A080198 A077637

Adjacent sequences:  A058056 A058057 A058058 * A058060 A058061 A058062

KEYWORD

nonn,hard,more

AUTHOR

Robert G. Wilson v, Nov 21 2000

EXTENSIONS

Terms 1478 and 2726 by Joerg Arndt, Apr 28 2012

Terms 5678 .. 15990 by Joerg Arndt, Apr 07 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 16 05:55 EDT 2022. Contains 356160 sequences. (Running on oeis4.)