Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057749
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057749 Prime degrees of absolutely reducible trinomials: primes p such that x^p + x^k + 1 is reducible over GF(2) for all k, p>k>0. +0
1
13, 19, 37, 43, 53, 59, 61, 67, 83, 101, 107, 109, 131, 139, 149, 157, 163, 173, 179, 181, 197, 211, 227, 229, 251, 269, 277, 283, 293, 307, 311, 317, 331, 347, 349, 373, 379, 389, 397, 419, 421, 443, 461, 467, 491, 499, 509, 523, 541, 547, 557, 563, 571 (list; graph; listen)
OFFSET

0,1

MATHEMATICA

Do[ k = 1; While[ ToString[ Factor[ x^Prime[ n ] + x^k + 1, Modulus -> 2 ] ] != ToString[ x^Prime[ n ] + x^k + 1 ] && k < Prime[ n ], k++ ]; If[ k == Prime[ n ], Print[ Prime[ n ] ] ], {n, 1, 144} ]

CROSSREFS

Adjacent sequences: A057746 A057747 A057748 this_sequence A057750 A057751 A057752

Sequence in context: A128342 A088186 A089490 this_sequence A040070 A048523 A000922

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 30 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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research