login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107220 Numbers n so that 1 + (x + x^3 + x^5 + x^7 + ...+ x^(2*n+1)) is irreducible over GF(2). 0
1, 3, 5, 7, 9, 13, 23, 27, 31, 37, 63, 69, 117, 119, 173, 219, 223, 247, 307, 363, 383, 495, 695, 987 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Joerg Arndt, fxtbook, section 40.9.10 "Irreducible alternating polynomials", pp.853

EXAMPLE

The number 5 is in the sequence because x^11 + x^9 + x^7 + x^5 + x^3 + x + 1 is irreducible over GF(2) (and 11=2*5+1)

PROG

(PARI) for(d=1, 1000, p=(1+sum(t=0, d, x^(2*t+1))); if(polisirreducible(Mod(1, 2)*p), print1(d, ", ")));

CROSSREFS

Sequence in context: A089228 A133847 A134180 * A098758 A029608 A145388

Adjacent sequences:  A107217 A107218 A107219 * A107221 A107222 A107223

KEYWORD

nonn,more

AUTHOR

Joerg Arndt (arndt(AT)jjj.de), Jun 08 2005

EXTENSIONS

More terms by Joerg, Apr 2 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 09:00 EST 2012. Contains 205746 sequences.