Smallest b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^p).
A281747
Smallest b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^p).
Terms
- a(0) =5a(1) =26a(2) =1068a(3) =82681a(4) =5392282366
External references
- oeis: A281747
A281747
Smallest b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^p).