a(1) = 1, a(2) = 3, for n >= 3, a(n) = smallest prime > a(n-1) such that a(n) mod a(n-1) = a(n-2).

A175094

a(1) = 1, a(2) = 3, for n >= 3, a(n) = smallest prime > a(n-1) such that a(n) mod a(n-1) = a(n-2).

Terms

    a(0) =1a(1) =3a(2) =7a(3) =17a(4) =41a(5) =181a(6) =1489a(7) =18049a(8) =218077a(9) =1326511a(10) =69196649a(11) =3045979067a(12) =67080736123a(13) =942176284789

External references