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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066876 Numbers n such that prime(n+2) + prime(n-2) = 2*prime(n). 1
 5, 6, 7, 27, 28, 36, 41, 54, 80, 82, 94, 126, 127, 131, 160, 177, 236, 248, 287, 339, 362, 385, 387, 400, 401, 410, 432, 433, 477, 485, 566, 579, 580, 581, 586, 599, 689, 700, 735, 744, 793, 821, 863, 874, 954, 1031, 1043, 1069, 1081, 1113, 1143, 1145, 1193 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS If (prime(n+2) + prime(n-2))/prime(n) is integer, that can only be 2. LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 MATHEMATICA Select[Range[3, 1200], Prime[ # ] == (Prime[ # + 2] + Prime[ # - 2])/2 &] (* Ray Chandler, Jan 09 2007 *) Flatten[Position[Partition[Prime[Range[1200]], 5, 1], _?(#[[1]]+#[[5]] == 2#[[3]]&), 1, Heads->False]]+2 (* Harvey P. Dale, Jan 01 2022 *) PROG (PARI) { n=0; for (m=3, 10^10, if (prime(m+2) + prime(m-2) == 2*prime(m), write("b066876.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Apr 03 2010 CROSSREFS Sequence in context: A273402 A217295 A272676 * A048042 A048090 A048027 Adjacent sequences: A066873 A066874 A066875 * A066877 A066878 A066879 KEYWORD nonn AUTHOR Benoit Cloitre, Jan 21 2002 EXTENSIONS Corrected and extended by Ray Chandler, Jan 09 2007 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.

Last modified December 9 09:12 EST 2023. Contains 367690 sequences. (Running on oeis4.)