|
|
A064102
|
|
Primes p = prime(k) such that prime(k) + prime(k+7) = prime(k+1) + prime(k+6) = prime(k+2) + prime(k+5) = prime(k+3) + prime(k+4).
|
|
1
|
|
|
17, 149, 677, 853, 1277, 5437, 6101, 13499, 13921, 19853, 22073, 41863, 49667, 51307, 51797, 55799, 61637, 66337, 83227, 91121, 100957, 103963, 109111, 113147, 128747, 136309, 137933, 148157, 158849, 163117, 167249, 179033, 205171, 208927
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
17 + 43 = 19 + 41 = 23 + 37 = 29 + 31.
|
|
MATHEMATICA
|
a = {0, 0, 0, 0, 0, 0, 0, 0}; Do[ a = Delete[ a, 1 ]; a = Append[ a, Prime[ n ] ]; If[ a[ [ 1 ] ] + a[ [ 8 ] ] == a[ [ 2 ] ] + a[ [ 7 ] ] == a[ [ 3 ] ] + a[ [ 6 ] ] == a[ [ 4 ] ] + a[ [ 5 ] ], Print[ a[ [ 1 ] ] ] ], {n, 1, 10^4} ]
|
|
PROG
|
(PARI) { n=0; default(primelimit, 8300000); for (k=1, 10^9, p1=prime(k) + prime(k + 7); p2=prime(k + 1) + prime(k + 6); p3=prime(k + 2) + prime(k + 5); p4=prime(k + 3) + prime(k + 4); if (p1==p2 && p2==p3 && p3==p4, write("b064102.txt", n++, " ", prime(k)); if (n==400, break)) ) } \\ Harry J. Smith, Sep 07 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|