240940299629domain: NAppears in sequencesa(n) = t is the smallest prime t > p = prime(n) for which t == p (mod k) for all k = 2,...,p-1.at n=9A378559