Smallest prime p such that p == 1 (mod prime(n)) and not p == 1 (mod k) for 2 < k < prime(n).
A116605
Smallest prime p such that p == 1 (mod prime(n)) and not p == 1 (mod k) for 2 < k < prime(n).
Terms
- a(0) =3a(1) =7a(2) =11a(3) =239a(4) =23a(5) =443a(6) =647a(7) =1103a(8) =47a(9) =59a(10) =2543a(11) =3923a(12) =83a(13) =9203a(14) =6299a(15) =107a(16) =7907a(17) =8663a(18) =11927a(19) =14627a(20) =12119a(21) =15959a(22) =167a(23) =179a(24) =20759a(25) =20807a(26) =23279a(27) =23327a(28) =28559a(29) =227
External references
- oeis: A116605