14906455

Appears in sequences

• Smallest b > 1 such that b^(p-1) == 1 (mod p^9) for p = prime(n).at n=3A353942
• a(n) is the least k such that k^2 + k + 1 is divisible by the n-th power of a prime.at n=8A372457