Smallest b > 1 such that b^(p-1) == 1 (mod p^9) for p = prime(n).
A353942
Smallest b > 1 such that b^(p-1) == 1 (mod p^9) for p = prime(n).
Terms
- a(0) =513a(1) =19682a(2) =280182a(3) =14906455a(4) =676386984a(5) =822557039a(6) =8185328614a(7) =1835323405a(8) =147534349327a(9) =430099398783a(10) =746688111476
External references
- oeis: A353942