A020157 Pseudoprimes to base 29.

4, 14, 15, 21, 28, 35, 52, 91, 105, 231, 268, 341, 364, 469, 481, 561, 651, 793, 871, 1105, 1729, 1876, 1897, 2105, 2257, 2821, 3484, 3523, 4069, 4371, 4411, 5149, 5185, 5356, 5473, 5565, 5611, 6097, 6601, 7161, 7294, 8321, 8401, 8421, 8841, 8911, 11041, 11581

Offset: 1

Author

David W. Wilson

Keywords

• nonn

Comments

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

Links

• R. J. Mathar and T. D. Noe, Table of n, a(n) for n = 1..1000 (R. J. Mathar 864 terms)
• Index entries for sequences related to pseudoprimes

Crossrefs

Cf. A001567 (pseudoprimes to base 2).

Programs

Mathematica

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