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.

A067999 Numbers k such that (k! - 1) == 0 (mod prime(k)).

Original entry on oeis.org

1, 3, 10, 149, 437
Offset: 1

Views

Author

Robert G. Wilson v, Feb 08 2002

Keywords

Comments

There are no more terms through 5000000. - Ryan Propper, Dec 30 2007
Numbers k such that A091858(k) = 1. - Zak Seidov, Oct 05 2012

Crossrefs

Programs

  • Mathematica
    f[n_] := Block[{k = p = 1, m = Prime[n]}, While[p = Mod[p k, m]; k < n, k++ ]; p]; Do[ If[ f[n] == 1, Print[n]], {n, 100000}] (* Robert G. Wilson v, Mar 16 2004 *)