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.
%I A067999 #18 Feb 11 2021 01:36:22
%S A067999 1,3,10,149,437
%N A067999 Numbers k such that (k! - 1) == 0 (mod prime(k)).
%C A067999 There are no more terms through 5000000. - _Ryan Propper_, Dec 30 2007
%C A067999 Numbers k such that A091858(k) = 1. - _Zak Seidov_, Oct 05 2012
%t A067999 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 *)
%Y A067999 Cf. A068000, A091858.
%K A067999 nonn,more
%O A067999 1,2
%A A067999 _Robert G. Wilson v_, Feb 08 2002