The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A107220 Numbers n such that 1 + (x + x^3 + x^5 + x^7 + ...+ x^(2*n+1)) is irreducible over GF(2). 0

%I

%S 1,3,5,7,9,13,23,27,31,37,63,69,117,119,173,219,223,247,307,363,383,

%T 495,695,987,2519,3919,4633,6537,8881,12841,15935,16383,16519,26525,

%U 34415,95139

%N Numbers n such that 1 + (x + x^3 + x^5 + x^7 + ...+ x^(2*n+1)) is irreducible over GF(2).

%C All terms are odd as irreducible polynomials over GF(2) necessarily have an odd number of nonzero coefficients.

%C Next term > 10^5. - _Joerg Arndt_, Apr 28 2012

%H Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 40.9.10 "Irreducible alternating polynomials", pp.853

%H N. J. A. Sloane et al., <a href="https://oeis.org/wiki/Binary_Quadratic_Forms_and_OEIS">Binary Quadratic Forms and OEIS</a> (Index to related sequences, programs, references)

%e 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).

%o (PARI) forstep(d=1,10^5,2, p=(1+sum(t=0,d,x^(2*t+1))); if(polisirreducible(Mod(1,2)*p), print1(d,", ")));

%o (Sage)

%o p = 1;

%o P.<x> = GF(2)[]

%o for n in range(1, 10^5, 2):

%o p = p + x^(2*(n-1)+1) + x^(2*n+1);

%o if p.is_irreducible():

%o print(n)

%o # _Joerg Arndt_, Apr 28 2012

%K nonn,hard,more

%O 1,2

%A _Joerg Arndt_, Jun 08 2005

%E More terms from _Joerg Arndt_, Apr 02 2011 and (terms >=2519), Apr 27 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 18:55 EST 2022. Contains 358475 sequences. (Running on oeis4.)
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}