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 A073944 #20 Sep 15 2023 17:49:13
%S A073944 1,2,4,3,5,12,16,9,14,18,30,36,40,21,23,52,15,8,18,7,72,23,13,88,96,
%T A073944 100,6,106,86,112,63,65,16,16,50,150,156,81,166,172,89,180,95,102,196,
%U A073944 99,210,222,61,228,64,210,240,97,31,131,9,93,40,280,282,45,63,220,312
%N A073944 a(n) is the smallest m such that n-th prime divides m! + 1.
%C A073944 Essentially the same as A072937. - _R. J. Mathar_, Sep 23 2008
%C A073944 By Wilson's theorem, a(n) < prime(n). Sequence A115092 gives the number of m such that prime(n) divides m!+1. - _T. D. Noe_, Mar 01 2006, Jan 10 2009
%H A073944 Jon E. Schoenfield, <a href="/A073944/b073944.txt">Table of n, a(n) for n = 1..10000</a> (first 2000 terms from T. D. Noe)
%t A073944 Table[p=Prime[i]; m=1; While[m<p && Mod[m!+1,p]>0, m++ ]; m, {i,100}] (* _T. D. Noe_, Mar 01 2006 *)
%t A073944 Module[{sm=Table[{m,m!+1},{m,400}]},Table[SelectFirst[sm,Mod[#[[2]],p]==0&],{p,Prime[ Range[70]]}]][[;;,1]] (* _Harvey P. Dale_, Sep 15 2023 *)
%Y A073944 Cf. A038507.
%Y A073944 Cf. A072937 (same sequence without a(1)).
%K A073944 easy,nonn
%O A073944 1,2
%A A073944 _Jason Earls_, Nov 13 2002