The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 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). 3

%I #10 Jul 18 2014 22:28:48

%S 2,3,5,11,31,53,239,557,7727,11069,88339,110477,1347223,2672947,

%T 8061839,24099521,362696759,2483454607,7561209233,67164119801,

%U 520836673781,923821392587,4048841435273,7744127005621,129209370063811

%N 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).

%C One might call them Fibonacci-type primes.

%H T. D. Noe, <a href="/A073680/b073680.txt">Table of n, a(n) for n=1..100</a>

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

%o (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)

%Y Cf. A072999, A072535.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Aug 11 2002

%E More terms from _Phil Carmody_, Aug 15 2002

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 June 17 00:51 EDT 2024. Contains 373432 sequences. (Running on oeis4.)