100651
domain: N
Appears in sequences
- Strong pseudoprimes to base 5.at n=16A020231
- Strong pseudoprimes to base 63.at n=36A020289
- Smallest solution to phi(x) = 10^n where phi(x) = A000010(x).at n=5A072075
- Duplicate of A072075.at n=5A097649
- Overpseudoprimes to base 5.at n=10A141390
- Fourth entry in row n of triangle in A169945.at n=24A169948
- Euler pseudoprimes to base 5: composite integers such that abs(5^((n - 1)/2)) == 1 mod n.at n=38A262052
- Base-5 Euler-Jacobi pseudoprimes: odd composite k coprime to 5 such that 5^((k-1)/2) == (5/k) (mod n), where (5/k) is the Jacobi symbol (or Kronecker symbol).at n=28A375914
- Composite numbers k == 1, 9 (mod 10) such that 5^((k-1)/2) == 1 (mod k).at n=27A375915