login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020185 Pseudoprimes to base 57. 1
4, 8, 14, 25, 28, 56, 65, 125, 145, 203, 217, 325, 377, 451, 721, 725, 781, 1001, 1105, 1625, 1885, 1891, 2047, 2296, 2465, 2701, 2821, 2911, 3193, 3277, 3565, 3625, 3976, 4141, 4187, 5365, 5425, 6461, 6533, 6601, 7501, 7613, 8029, 8401, 9373, 9425, 10325 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Composite numbers n such that 57^(n-1) == 1 (mod n).
LINKS
MATHEMATICA
base = 57; t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n] && PowerMod[base, n-1, n] == 1, AppendTo[t, n]]]; t (* T. D. Noe, Feb 21 2012 *)
PROG
(PARI) isA020185(n) = (Mod(57, n)^(n-1)==1) && (!isprime(n))
CROSSREFS
Cf. A001567 (pseudoprimes to base 2).
Sequence in context: A131831 A100314 A105143 * A008029 A129080 A138643
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 23:26 EST 2023. Contains 367503 sequences. (Running on oeis4.)