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 A061769 #2 Mar 30 2012 17:30:32
%S A061769 1,5,11,23,35,39,44,47,59,71,79,89,119,143,179,239,359,479,629,671,
%T A061769 719,1079,1119,1259,1343,1439,1889,2015,2159,2239,2519,2879,3023,3359,
%U A061769 3779,4031,4319,5039,6047,6719,7559,8639,10079
%N A061769 The least number k = a(n) > a(n-1) for which k!/(k+1)^m for increasing m's.
%e A061769 a(5) = 35 (one of the few composites in this sequence) because 35 is the least number such that 35!/36^7 and 23!/24^6.
%t A061769 l = 0; Do[k = Max[l - 1, 1]; While[ !IntegerQ[ k! / (k + 1)^n], k++ ]; If[ k > l, l = k; Print[k] ], {n, 0, 1500} ]
%K A061769 nonn
%O A061769 0,2
%A A061769 _Robert G. Wilson v_, Jun 21 2001