login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066515 Numbers n such that p(n+1)+p(n-2)=2p(n-1), where p(m) is the m-th prime. 1
13, 20, 60, 93, 113, 116, 141, 212, 234, 254, 262, 269, 277, 286, 292, 295, 302, 323, 353, 359, 370, 390, 408, 418, 474, 501, 543, 599, 613, 625, 715, 719, 724, 743, 820, 934, 940, 995, 999, 1017, 1099, 1120, 1264, 1300, 1313, 1401, 1415, 1419, 1423 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Equivalently, n such that f(n) = f(n-2)-f(n-1) where f is the prime gaps function given by f(m) = p(m+1)-p(m).

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

MATHEMATICA

Select[ Range[ 3, 1440 ], Prime[ #+1 ]+Prime[ #-2 ]==2Prime[ #-1 ]& ]

PROG

(PARI) { n=0; for (m=3, 10^10, if (prime(m+1) + prime(m-2) == 2*prime(m-1), write("b066515.txt", n++, " ", m); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 20 2010]

CROSSREFS

Sequence in context: A164462 A164508 A132946 * A166656 A032693 A034294

Adjacent sequences:  A066512 A066513 A066514 * A066516 A066517 A066518

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 04 2002

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 10, 2002.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:07 EST 2012. Contains 205930 sequences.