a(0) = 2; for n>0, a(n) = smallest prime p such that p > a(n-1) and p is congruent to n modulo prime(n).

A261192

a(0) = 2; for n>0, a(n) = smallest prime p such that p > a(n-1) and p is congruent to n modulo prime(n).

Terms

    a(0) =2a(1) =3a(2) =5a(3) =13a(4) =53a(5) =71a(6) =97a(7) =109a(8) =179a(9) =193a(10) =271a(11) =383a(12) =419a(13) =587a(14) =659a(15) =673a(16) =811a(17) =1433a(18) =1543a(19) =1627a(20) =2221a(21) =2357a(22) =4051a(23) =4339a(24) =4919a(25) =5651a(26) =5783a(27) =6619a(28) =6983a(29) =7877

External references