Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133485
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133485 Integers n such that the polynomial x^(2n+2)+x+1 is primitive and irreducible over GF(2). +0
1
0, 2, 10, 29, 265, 449, 682 (list; graph; listen)
OFFSET

1,2

COMMENT

An integer n>0 belongs to this sequence iff A100730(n)=2^(2n+3)-2. Alternatively, n belongs to this sequence iff 2n+2 belongs to A073639.

The polynomial x^(2n+2)+x+1 in the definition could be replaced by its reciprocal x^(2n+2)+x^(2n+1)+1.

CROSSREFS

Sequence in context: A101561 A047112 A032250 this_sequence A098425 A098408 A063564

Adjacent sequences: A133482 A133483 A133484 this_sequence A133486 A133487 A133488

KEYWORD

nonn,more,hard

AUTHOR

Max Alekseyev (maxal(AT)cs.ucsd.edu), Dec 02 2007, Feb 15 2008

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 4 21:30 EST 2008. Contains 151309 sequences.


AT&T Labs Research