The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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).