login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020166 Pseudoprimes to base 38. 1
39, 65, 85, 91, 111, 185, 221, 259, 289, 469, 481, 561, 629, 697, 871, 1105, 1221, 1443, 1445, 2405, 2465, 2479, 2553, 2665, 2701, 2821, 3145, 3367, 3585, 3757, 4033, 4187, 4681, 5291, 5461, 6031, 6097, 6601, 6931, 7449, 7585, 7613, 7957, 8177, 9073, 9919 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Composite numbers n such that 38^(n-1) == 1 (mod n). - Michel Lagneau, Feb 18 2012

LINKS

T. D. Noe, Table of n, a(n) for n = 1..1000

Index entries for sequences related to pseudoprimes

MATHEMATICA

base = 38; 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 *)

CROSSREFS

Cf. A001567 (pseudoprimes to base 2).

Sequence in context: A043956 A090876 A165461 * A046448 A249701 A039467

Adjacent sequences:  A020163 A020164 A020165 * A020167 A020168 A020169

KEYWORD

nonn

AUTHOR

David W. Wilson

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)