Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057476
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A057476
%S A057476 1,3,5,7,17,31,71,97,167,175,209,385
%N A057476 Numbers n such that x^n + x^6 + 1 is irreducible over GF(2).
%t A057476 Do[ If[ ToString[ Factor[ x^n + x^6 + 1, Modulus -> 2 ] ] == ToString[ 
               x^n + x^6 + 1 ], Print[ n ] ], {n, 0, 750} ]
%Y A057476 Cf. A002475.
%Y A057476 Sequence in context: A141772 A032496 A002092 this_sequence A016041 A140797 
               A038893
%Y A057476 Adjacent sequences: A057473 A057474 A057475 this_sequence A057477 A057478 
               A057479
%K A057476 nonn
%O A057476 1,2
%A A057476 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research