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!)
 A066495 Numbers k such that f(k) = f(k-1) + f(k-2) where f denotes the prime gaps function given by f(m) = prime(m+1) - prime(m). 5
 4, 9, 15, 21, 51, 71, 118, 184, 208, 227, 231, 238, 255, 267, 290, 317, 326, 354, 381, 392, 396, 437, 494, 499, 544, 553, 569, 627, 645, 660, 720, 756, 796, 922, 932, 937, 960, 968, 990, 1027, 1034, 1087, 1103, 1130, 1157, 1173, 1175, 1227, 1237, 1251 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A138042(n) + 2 [based on the formula found from A138042]. - Antti Karttunen, Jul 13 2013 EXAMPLE f(9) = 6 = 4 + 2 = f(8) + f(7); so 9 is a term. MATHEMATICA f[n_] := Prime[n + 1] - Prime[n]; Select[Range[3, 10^4], f[ # ] == f[ # - 1] + f[ # - 2] &] PROG (Scheme with Antti Karttunen's IntSeq-library) (define A066495 (MATCHING-POS 1 1 (lambda (n) (and (> n 2) (= (A001223 n) (+ (A001223 (- n 1)) (A001223 (- n 2)))))))) (define (A066495v2 n) (+ 2 (A138042 n))) ;; Alternative definition. CROSSREFS Cf. A000040 (function p in the definition). Cf. A001223 (function f in the definition). Cf. also A109226, A138042, A227419. Sequence in context: A103393 A103392 A073046 * A313298 A313299 A350547 Adjacent sequences: A066492 A066493 A066494 * A066496 A066497 A066498 KEYWORD nonn AUTHOR Joseph L. Pe, Jan 03 2002 EXTENSIONS Extended by Ray Chandler, Aug 23 2005 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 4 15:16 EST 2023. Contains 367563 sequences. (Running on oeis4.)