a(1) = 2. For n > 1, a(n) = smallest prime q such that q^(a(n-1)-1) == 1 (mod a(n-1)^2).
A355597
a(1) = 2. For n > 1, a(n) = smallest prime q such that q^(a(n-1)-1) == 1 (mod a(n-1)^2).
Terms
- a(0) =2a(1) =5a(2) =7a(3) =19a(4) =127a(5) =911a(6) =7331a(7) =167149a(8) =387749a(9) =17153317a(10) =432383657a(11) =10459192927a(12) =125224780937
External references
- oeis: A355597