Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057479 Numbers n such that x^n + x^9 + 1 is irreducible over GF(2). +0
2
1, 4, 5, 8, 11, 12, 14, 18, 23, 28, 30, 36, 49, 54, 60, 68, 71, 79, 84, 103, 113, 151, 156, 191, 198, 364, 390, 470, 476, 508, 540, 620, 721 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

Cf. A002475.

Sequence in context: A022435 A116050 A056721 this_sequence A050140 A047376 A117573

Adjacent sequences: A057476 A057477 A057478 this_sequence A057480 A057481 A057482

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 27 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 December 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research