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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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; 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

Cf. A072999

Sequence in context: A182987 A087580 A072535 * A079557 A090709 A112279

Adjacent sequences:  A073677 A073678 A073679 * A073681 A073682 A073683

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 11 2002

EXTENSIONS

More terms from Phil Carmody (pc+oeis(AT)asdf.org), Aug 15 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 15 21:56 EST 2012. Contains 205860 sequences.