I wondered whether someone on the list had a file of base-5 Fermat pseudoprimes up to a large number, e.g. 10^16. Either definition would be OK, namely 5^n == 5 (mod n) (A122782) or the stronger 5^(n-1)==1 (mod n) (A005936); the first would be preferable. Neil -- Neil Fernandez