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 A071960 #10 Mar 10 2020 23:30:12
%S A071960 0,0,0,0,1,0,3,2,1,0,1,0,3,2,1,0,1,0,3,2,1,0,5,4,3,2,1,0,1,0,5,4,3,2,
%T A071960 1,0,3,2,1,0,1,0,3,2,1,0,5,4,3,2,1,0,5,4,3,2,1,0,1,0,5,4,3,2,1,0,3,2,
%U A071960 1,0,1,0,5,4,3,2,1,0,3,2,1,0,5,4,3,2,1,0,7,6,5,4,3,2,1,0,3,2,1,0,1,0,3,2,1
%N A071960 Largest k >= 0 such that Product_{i=0..k} (n+i) divides n!.
%C A071960 If a(n) > 0, a(n+1) = a(n) - 1.
%H A071960 Jinyuan Wang, <a href="/A071960/b071960.txt">Table of n, a(n) for n = 1..1000</a>
%F A071960 a(n) = A064778(n) - n.
%e A071960 7*8*9*10 divides 7! hence a(7) = 3.
%o A071960 (PARI) for(n=1,150,s=0; while(sum(i=1,s,n!%(n+i))==0,s++); print1(s-1,","))
%Y A071960 Cf. A064778.
%K A071960 nonn,easy
%O A071960 1,7
%A A071960 _Benoit Cloitre_, Jun 25 2002