cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A020228 Pseudoprimes to base 100.

Original entry on oeis.org

9, 33, 91, 99, 153, 259, 303, 451, 481, 561, 657, 703, 909, 949, 1111, 1233, 1241, 1729, 1891, 2047, 2329, 2409, 2701, 2821, 2871, 2981, 3333, 3367, 4141, 4187, 4521, 5461, 5551, 6001, 6533, 6541, 6601, 6931, 7107, 7373, 7471, 7633, 7777, 8149, 8401, 8911
Offset: 1

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A001567 (pseudoprimes to base 2).

Programs

  • Mathematica
    base = 100; 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 *)