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 A061768 #9 Mar 26 2019 16:18:42
%S A061768 5,11,11,11,23,23,35,39,44,47,59,59,59,71,71,71,79,79,89,89,119,119,
%T A061768 119,119,119,119,119,143,143,143,143,143,143,143,179,179,179,179,179,
%U A061768 179,179,179,179,239,239,239,239,239,239,239,239,239,239,239,239,239
%N A061768 k is the least number such that k! is divisible by (k+1)^n.
%H A061768 David A. Corneth, <a href="/A061768/b061768.txt">Table of n, a(n) for n = 1..10000</a>
%H A061768 David A. Corneth, <a href="/A061768/a061768.gp.txt">PARI program</a>
%e A061768 a(4) = 11 as (11 + 1) = 2^2 * 3 and 11! = 2^8 * 3^4 * k (we don't care about the other factors as 12 doesn't divide them). 4 is the largest m such that 12^m divides 11! so a(1) through a(4) are at most 11. - _David A. Corneth_, Mar 15 2019
%t A061768 Do[k = 1; While[ !IntegerQ[ k! / (k + 1)^n], k++ ]; Print[k], {n, 1, 100} ]
%o A061768 (PARI) a(n)=my(k=n);while(k++!%(k+1)^n,);k \\ _Charles R Greathouse IV_, Apr 16 2015
%o A061768 (PARI) See Corneth link \\ _David A. Corneth_, Mar 15 2019
%K A061768 nonn
%O A061768 1,1
%A A061768 _Robert G. Wilson v_, Jun 21 2001