2387947

Appears in sequences

• Table T(k, n) of smallest bases b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^k), read by antidiagonals.at n=51A257833
• Smallest b > 1 such that b^(p-1) == 1 (mod p^8) for p = prime(n).at n=3A353941
• a(n) is the least k such that k^2 + k + 1 is divisible by the n-th power of a prime.at n=7A372457