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