Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058235
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058235 Numbers n such that x^n + x^2 + 2 is irreducible over GF(3). +0
1
1, 3, 4, 7, 8, 11, 12, 15, 19, 28, 35, 60, 67, 80, 108, 111, 119, 151, 183, 331, 631, 728, 892 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

Do[ If[ ToString[ Factor[ x^n + x^2 + 2, Modulus -> 3 ] ] == ToString[ x^n + x^2 + 2 ], Print[ n ] ], {n, 0, 1000} ]

CROSSREFS

Cf. A057460.

Sequence in context: A026444 A003171 A028970 this_sequence A067186 A133675 A050122

Adjacent sequences: A058232 A058233 A058234 this_sequence A058236 A058237 A058238

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 01 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research