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.

A233518 Primes p such that x^x == x (mod p) for some number x with 1 < x < p.

Original entry on oeis.org

7, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 61, 67, 71, 73, 79, 89, 97, 101, 103, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 181, 191, 193, 197, 199, 211, 223, 229, 233, 239, 241, 251, 257, 263, 271, 277, 281, 283, 307, 311, 313, 331, 337
Offset: 1

Views

Author

T. D. Noe, Feb 18 2014

Keywords

Comments

Complement of A065296.

Crossrefs

Programs

  • Mathematica
    fQ[p_] := Min[Table[Mod[PowerMod[x, x, p] - x, p], {x, 2, p - 1}]] == 0; Select[Prime[Range[2, 100]], fQ[#] &]