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

A175207

a(1) = 1, a(2) = 5, 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) =5a(2) =11a(3) =71a(4) =863a(5) =10427a(6) =42571a(7) =95569a(8) =2145089a(9) =42997349a(10) =1292065559a(11) =12963652939a(12) =27219371437a(13) =285157367309

External references