125224780937domain: NAppears in sequencesa(1) = 2. For n > 1, a(n) = smallest prime q such that q^(a(n-1)-1) == 1 (mod a(n-1)^2).at n=12A355597