A073680 - OEIS

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A073680

a(1) =2, a(2) = 3, a(n+2) = smallest prime such that a(n+2) - a(n+1) is a multiple of a(n).

2, 3, 5, 11, 31, 53, 239, 557, 7727, 11069, 88339, 110477, 1347223, 2672947, 8061839, 24099521, 362696759, 2483454607, 7561209233, 67164119801, 520836673781, 923821392587, 4048841435273, 7744127005621, 129209370063811

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

One might call them Fibonacci-type primes.

LINKS

T. D. Noe, Table of n, a(n) for n=1..100

EXAMPLE

a(6)-a(5) = 53-31 = 22 is a multiple of 11 = a(4).

PROG

(PARI) l=2; h=3; print("2, 3, "); while(l<2^128, t=l+h; while(!isprime(t), t+=l); print1(t, ", "); l=h; h=t)

CROSSREFS