login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072667 Consider m such that prime(m) + prime(m+1) = prime(k) + 1 for some k; sequence gives values of prime(m). 5
3, 5, 7, 11, 13, 19, 29, 31, 41, 43, 61, 67, 73, 97, 113, 127, 151, 179, 191, 193, 199, 211, 223, 229, 239, 241, 271, 277, 281, 293, 307, 317, 337, 349, 367, 373, 379, 397, 401, 409, 419, 431, 439, 463, 487, 523, 541, 547, 577, 613, 619, 641, 643, 659, 683, 701, 709, 727 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Vincenzo Librandi and Harvey P. Dale, Table of n, a(n) for n = 1..10000 ( first 1000 terms from Vincenzo Librandi)
FORMULA
a(n) = prime(A072666(n)) = A000040(A072666(n)). - Zak Seidov, Dec 08 2014
MATHEMATICA
Transpose[Select[Partition[Prime[Range[130]], 2, 1], PrimeQ[Total[#]-1]&]] [[1]] (* Harvey P. Dale, Feb 29 2012 *)
Select[Prime[Range[200]], PrimeQ[#+NextPrime[#]-1]&] (* Vincenzo Librandi, Aug 26 2012 *)
PROG
(Magma) [NthPrime(n): n in [1..200] | IsPrime(NthPrime(n) + NthPrime(n+1)-1)] // Vincenzo Librandi, Aug 26 2012
CROSSREFS
Sequence in context: A059334 A130761 A154966 * A092729 A290817 A059353
KEYWORD
nonn
AUTHOR
Herman H. Rosenfeld (herm3(AT)pacbell.net), Aug 12 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 08:06 EDT 2024. Contains 373543 sequences. (Running on oeis4.)