Smallest b > 1 such that b^(p-1) == 1 (mod p^10) for p = prime(n).

A353943

Smallest b > 1 such that b^(p-1) == 1 (mod p^10) for p = prime(n).

Terms

    a(0) =1025a(1) =59048a(2) =3626068a(3) =135967276a(4) =1509748675a(5) =14149342837a(6) =109522148350a(7) =649340249056a(8) =191730243526

External references