login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A072669
Primes of the form prime(x) + prime(x+1) - 1.
15
7, 11, 17, 23, 29, 41, 59, 67, 83, 89, 127, 137, 151, 197, 239, 257, 307, 359, 383, 389, 409, 433, 449, 461, 479, 491, 547, 557, 563, 599, 617, 647, 683, 701, 739, 751, 761, 797, 809, 827, 839, 863, 881, 929, 977, 1063, 1087, 1103, 1163, 1229, 1249, 1283, 1289, 1319, 1373
OFFSET
1,1
COMMENTS
Consider m such that prime(m) + prime(m+1) = prime(k) + 1 for some k; sequence gives prime(k).
A118072 is a subsequence, hence this sequence is infinite on Dickson's conjecture. - Charles R Greathouse IV, Apr 18 2013
LINKS
MATHEMATICA
f[n_] := Prime[n] + Prime[n + 1] - 1; f[ # ] & /@ Select[ Range[120], PrimeQ[ f[ # ]] &] (* Robert G. Wilson v, Apr 14 2004 *)
Select[Total[#]-1&/@Partition[Prime[Range[200]], 2, 1], PrimeQ] (* Harvey P. Dale, Aug 06 2012 *)
PROG
(PARI) p=2; forprime(q=3, 1e6, if(isprime(p+q-1), print1(p+q-1", ")); p=q) \\ Charles R Greathouse IV, Apr 18 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Herman H. Rosenfeld (herm3(AT)pacbell.net), Aug 12 2002
EXTENSIONS
Definition reworded by Jorge Coveiro, Apr 12 2004
Edited by N. J. A. Sloane, Sep 14 2008 at the suggestion of R. J. Mathar
STATUS
approved