a(n) = least k > 0 such that prime(k) == n (mod k).

Terms

a(0) =1a(1) =2a(2) =3a(3) =4a(4) =75a(5) =9a(6) =79a(7) =18a(8) =17a(9) =10a(10) =19a(11) =20a(12) =91a(13) =22a(14) =23a(15) =41a(16) =83a(17) =24a(18) =16049a(19) =43a(20) =2711a(21) =94a(22) =25a(23) =26a(24) =95a(25) =198a(26) =449a(27) =452a(28) =99a(29) =50