cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A122035 Primes p = Prime[m] such that polynomial (1 + Sum[x^Prime[k],{k,1,m}]) factors over the integers.

This page as a plain text file.
%I A122035 #7 Mar 31 2012 13:20:28
%S A122035 5,17,41,461
%N A122035 Primes p = Prime[m] such that polynomial (1 + Sum[x^Prime[k],{k,1,m}]) factors over the integers.
%C A122035 Corresponding numbers m such that a(n) = Prime[m] are {3,7,13,89,...}. All 4 listed initial terms of a(n) coincide with A007351[n+1].
%C A122035 The polynomial is divisible by x^2+1 if and only if p is a member of A007351. - _David Wasserman_, May 20 2008
%C A122035 No other terms below 4175. - _Max Alekseyev_, May 31 2008
%e A122035 a(1) = 5 because Factor[1+x^2+x^3+x^5] = (x+1)*(x^2+1)*(x^2-x+1), but polynomials (1+x^2) and (1+x^2+x^3) do not factor over the integers.
%e A122035 a(2) = 17 because Factor[1+x^2+x^3+x^5+x^7+x^11+x^13+x^17] = (x^2+1)*(x^15-x^13+2x^11-x^9+x^7+x^3+1).
%Y A122035 Cf. A038691, A007351.
%K A122035 more,nonn
%O A122035 1,1
%A A122035 _Alexander Adamchuk_, Sep 13 2006