Smallest prime == 1 (mod p*q*...*k) where p, q, ..., k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest squarefree divisor of n).

A085641

Smallest prime == 1 (mod p*q*...*k) where p, q, ..., k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest squarefree divisor of n).

Terms

    a(0) =2a(1) =3a(2) =7a(3) =3a(4) =11a(5) =7a(6) =29a(7) =3a(8) =7a(9) =11a(10) =23a(11) =7a(12) =53a(13) =29a(14) =31a(15) =3a(16) =103a(17) =7a(18) =191a(19) =11a(20) =43a(21) =23a(22) =47a(23) =7a(24) =11a(25) =53a(26) =7a(27) =29a(28) =59a(29) =31

External references