|
|
A127336
|
|
Numbers that are the sum of 9 consecutive primes.
|
|
13
|
|
|
100, 127, 155, 187, 221, 253, 287, 323, 363, 401, 439, 479, 515, 553, 593, 635, 679, 721, 763, 803, 841, 881, 929, 977, 1025, 1067, 1115, 1163, 1213, 1267, 1321, 1367, 1415, 1459, 1511, 1555, 1601, 1643, 1691, 1747, 1801, 1851, 1903, 1951, 1999, 2053
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) = absolute value of coefficient of x^8 of the polynomial Product_{j=0..8}(x - prime(n+j)) of degree 9; the roots of this polynomial are prime(n), ..., prime(n+8).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[Plus@@Prime[Range[n, n + 8]], {n, 50}] (* Alonso del Arte, Aug 27 2013 *)
Total/@Partition[Prime[Range[60]], 9, 1] (* Harvey P. Dale, Nov 18 2020 *)
|
|
PROG
|
(PARI) {m=46; k=9; for(n=1, m, print1(a=sum(j=0, k-1, prime(n+j)), ", "))} \\ Klaus Brockhaus, Jan 13 2007
{m=46; k=9; for(n=1, m, print1(abs(polcoeff(prod(j=0, k-1, (x-prime(n+j))), k-1)), ", "))} \\ Klaus Brockhaus, Jan 13 2007
(Magma) [&+[ NthPrime(n+k): k in [0..8] ]: n in [1..100] ]; // Vincenzo Librandi, Apr 03 2011
(Python)
from sympy import prime
def a(x): return sum([prime(x + n) for n in range(9)])
|
|
CROSSREFS
|
Cf. A011974, A001043, A034961, A034963, A034964, A127333, A127334, A127335, A127337, A127338, A127339, A082251, A228200.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|