|
| |
|
|
A114235
|
|
n(k) is the largest prime which is smaller than Prime[k] and makes 2*Prime[k]+Prime[n] a prime.
|
|
8
| |
|
|
3, 5, 7, 11, 13, 5, 13, 13, 17, 29, 31, 41, 43, 43, 31, 59, 59, 37, 53, 71, 73, 79, 89, 79, 101, 103, 89, 67, 113, 127, 127, 131, 103, 137, 149, 137, 157, 163, 163, 179, 181, 191, 193, 179, 197, 197, 223, 173, 211, 223, 227, 241, 229, 193, 223, 269, 269, 277, 263
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,1
|
|
|
EXAMPLE
| k=3: 2*Prime[3]+3=2*5+3=13 is prime, so n(3)=3;
k=4: 2*Prime[4]+5=2*7+5=19 is prime, so n(4)=5;
...
k=8: 2*Prime[8]+17=2*19+17=55 is not prime
2*Prime[8]+13=2*19+13=51 is not prime
...
2*Prime[8]+5=2*19+5=43 is prime, so n(8)=5;
|
|
|
MATHEMATICA
| Table[p1 = Prime[n1]; n2 = 1; p2 = Prime[n1 - n2]; While[cp = 2*p1 + p2; ! PrimeQ[cp], n2++; If[n2 >= n1, Print[n1]]; p2 = Prime[n1 - n2]]; p2, {n1, 3, 202}]
|
|
|
CROSSREFS
| Cf. A114227, A114230, A073703.
Sequence in context: A109908 A152212 A102941 * A086527 A161554 A070087
Adjacent sequences: A114232 A114233 A114234 * A114236 A114237 A114238
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Lei Zhou (lzhou5(AT)emory.edu), Nov 20 2005
|
| |
|
|
