|
Search: id:A114231
|
|
|
| A114231 |
|
n(k) is the minimum number that makes Prime[k]+2*Prime[k-n(k)] a prime. |
|
+0 6
|
|
| 1, 1, 1, 3, 3, 1, 1, 1, 2, 1, 3, 2, 4, 4, 2, 9, 1, 3, 2, 4, 5, 1, 5, 2, 8, 3, 1, 3, 1, 1, 3, 8, 2, 6, 1, 4, 3, 8, 2, 7, 7, 14, 9, 7, 1, 4, 3, 1, 1, 1, 5, 1, 1, 2, 8, 4, 1, 8, 2, 4, 1, 8, 3, 9, 5, 3, 2, 1, 4, 1, 4, 4, 2, 3, 2, 4, 2, 12, 3, 1, 1, 3, 12, 2, 1, 2, 5, 5, 3, 3, 10, 4, 19, 1, 6, 4, 8, 7, 2, 5, 9, 2, 3
(list; graph; listen)
|
|
|
OFFSET
|
2,4
|
|
|
EXAMPLE
|
k=2, Prime[2]+2*Prime[2-1]=3+2*2=7 is prime, so n(2)=1;
k=3, Prime[3]+2*Prime[3-1]=5+2*3=11 is prime, so n(3)=1;
...
k=17, Prime[17]+2*Prime[17-9]=59+2*19=97 is prime, so n(17)=9
|
|
MATHEMATICA
|
Table[p1 = Prime[n1]; n2 = n1 - 1; p2 = Prime[n2]; While[cp = p1 + 2*p2; ! PrimeQ[cp], n2--; If[n2 == 0, Print[n1]]; p2 = Prime[n2]]; n1 - n2, {n1, 2, 201}]
|
|
CROSSREFS
|
Cf. A114231, A114227, A114228.
Sequence in context: A046532 A014421 A127197 this_sequence A079075 A086703 A072917
Adjacent sequences: A114228 A114229 A114230 this_sequence A114232 A114233 A114234
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Lei Zhou (lzhou5(AT)emory.edu), Nov 18 2005
|
|
|
Search completed in 0.002 seconds
|