|
Search: id:A122035
|
|
|
| A122035 |
|
Primes p = Prime[m] such that polynomial (1 + Sum[x^Prime[k],{k,1,m}]) factors over the integers. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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].
The polynomial is divisible by x^2+1 if and only if p is a member of A007351. - David Wasserman (dwasserm(AT)earthlink.net), May 20 2008
No other terms below 4175. - Max Alekseyev (maxale(AT)gmail.com), May 31 2008
|
|
EXAMPLE
|
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.
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).
|
|
CROSSREFS
|
Cf. A038691, A007351.
Sequence in context: A111268 A106973 A102264 this_sequence A052350 A096741 A111746
Adjacent sequences: A122032 A122033 A122034 this_sequence A122036 A122037 A122038
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 13 2006
|
|
|
Search completed in 0.002 seconds
|
