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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020193 Pseudoprimes to base 65. 1
4, 8, 16, 28, 32, 33, 64, 112, 133, 232, 289, 448, 511, 561, 703, 1111, 1247, 1387, 1856, 1891, 1921, 2452, 2701, 3439, 3553, 3729, 4291, 4564, 5068, 6533, 6601, 6697, 8321, 8911, 9537, 9709, 9808, 9809, 10681, 11077, 11584, 11647, 12754, 13213, 14981 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Composite numbers n such that 65^(n-1) == 1 (mod n).

LINKS

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

Index entries for sequences related to pseudoprimes

MATHEMATICA

base = 65; 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: A303544 A273029 A273080 * A176817 A050856 A271649

Adjacent sequences:  A020190 A020191 A020192 * A020194 A020195 A020196

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 April 21 04:56 EDT 2019. Contains 322310 sequences. (Running on oeis4.)