This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A072669 #15 Jan 21 2019 19:01:55 %S A072669 7,11,17,23,29,41,59,67,83,89,127,137,151,197,239,257,307,359,383,389, %T A072669 409,433,449,461,479,491,547,557,563,599,617,647,683,701,739,751,761, %U A072669 797,809,827,839,863,881,929,977,1063,1087,1103,1163,1229,1249,1283,1289,1319,1373 %N A072669 Primes of the form prime(x) + prime(x+1) - 1. %C A072669 Consider m such that prime(m) + prime(m+1) = prime(k) + 1 for some k; sequence gives prime(k). %C A072669 A118072 is a subsequence, hence this sequence is infinite on Dickson's conjecture. - _Charles R Greathouse IV_, Apr 18 2013 %H A072669 Vincenzo Librandi, <a href="/A072669/b072669.txt">Table of n, a(n) for n = 1..1000</a> %t A072669 f[n_] := Prime[n] + Prime[n + 1] - 1; f[ # ] & /@ Select[ Range[120], PrimeQ[ f[ # ]] &] (* _Robert G. Wilson v_, Apr 14 2004 *) %t A072669 Select[Total[#]-1&/@Partition[Prime[Range[200]],2,1],PrimeQ] (* _Harvey P. Dale_, Aug 06 2012 *) %o A072669 (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 %Y A072669 Cf. A001043, A092738, A072666, A072667. %K A072669 nonn,easy %O A072669 1,1 %A A072669 Herman H. Rosenfeld (herm3(AT)pacbell.net), Aug 12 2002 %E A072669 Definition reworded by _Jorge Coveiro_, Apr 12 2004 %E A072669 Edited by _N. J. A. Sloane_, Sep 14 2008 at the suggestion of _R. J. Mathar_