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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020161 Pseudoprimes to base 33. 1
 4, 8, 16, 32, 85, 496, 545, 703, 1057, 1105, 1417, 1649, 1729, 1853, 2465, 2501, 2821, 3368, 4033, 4492, 4681, 5461, 5713, 5833, 6533, 6601, 7861, 8911, 9061, 9073, 9265, 10585, 11305, 11359, 12209, 12403, 13741, 15841, 16589, 16745, 17968, 18103, 19909 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Composite numbers n such that 33^(n-1) == 1 (mod n). LINKS T. D. Noe, Table of n, a(n) for n = 1..1000 MATHEMATICA base = 33; 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 *) Select[Range[20000], CompositeQ[#]&&PowerMod[33, #-1, #]==1&] (* Harvey P. Dale, Oct 05 2015 *) CROSSREFS Cf. A001567 (pseudoprimes to base 2). Sequence in context: A338313 A049932 A272712 * A068890 A073856 A019458 Adjacent sequences: A020158 A020159 A020160 * A020162 A020163 A020164 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.

Last modified December 2 20:59 EST 2022. Contains 358510 sequences. (Running on oeis4.)