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 A072667 #18 Sep 08 2022 08:45:06 %S A072667 3,5,7,11,13,19,29,31,41,43,61,67,73,97,113,127,151,179,191,193,199, %T A072667 211,223,229,239,241,271,277,281,293,307,317,337,349,367,373,379,397, %U A072667 401,409,419,431,439,463,487,523,541,547,577,613,619,641,643,659,683,701,709,727 %N A072667 Consider m such that prime(m) + prime(m+1) = prime(k) + 1 for some k; sequence gives values of prime(m). %H A072667 Vincenzo Librandi and Harvey P. Dale, <a href="/A072667/b072667.txt">Table of n, a(n) for n = 1..10000</a> ( first 1000 terms from Vincenzo Librandi) %F A072667 a(n) = prime(A072666(n)) = A000040(A072666(n)). - _Zak Seidov_, Dec 08 2014 %t A072667 Transpose[Select[Partition[Prime[Range[130]], 2, 1], PrimeQ[Total[#]-1]&]] [[1]] (* _Harvey P. Dale_, Feb 29 2012 *) %t A072667 Select[Prime[Range[200]],PrimeQ[#+NextPrime[#]-1]&] (* _Vincenzo Librandi_, Aug 26 2012 *) %o A072667 (Magma) [NthPrime(n): n in [1..200] | IsPrime(NthPrime(n) + NthPrime(n+1)-1)] // _Vincenzo Librandi_, Aug 26 2012 %Y A072667 Cf. A072666, A072669, A177017. %K A072667 nonn %O A072667 1,1 %A A072667 Herman H. Rosenfeld (herm3(AT)pacbell.net), Aug 12 2002