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 A076041 #12 Oct 22 2014 16:25:14
%S A076041 1,2,6,3,7,42,1512,2000376,3556892570112,11386336279786153952123289,
%T A076041 117862412614885811248635740101130996768076206774085
%N A076041 a(n) = n! for n < 4; else a(n) = floor(P(n-1)/n) where P(n) = a(1) * a(2) * ... * a(n).
%C A076041 Original definition: a(1)=1, a(n)=n*P(n-1) if P(n-1) < n, a(n) = floor(P(n-1)/n) if n <= P(n-1), where P(n-1) = a(1) * a(2) * ... * a(n-1).
%C A076041 Next term a(12) = 1273391928...9197035520 ~ 1.27*10^100 has 101 digits. - _M. F. Hasler_, Oct 21 2014
%e A076041 a(4) = floor(1*2*6/4) = 3.
%e A076041 a(5) = floor(1*2*6*3/5) = floor(36/5) = 7.
%t A076041 a[1] = 1; p[n_] := Product[a[k], {k, 1, n}]; a[n_ /; p[n-1] < n] := a[n] = n*p[n-1]; a[n_ /; n < p[n-1]] := a[n] = Floor[p[n-1]/n]; Table[a[n], {n, 1, 12}] (* _Jean-François Alcover_, Jul 22 2013 *)
%o A076041 (PARI) a(n)=if(n<4,n!,P=3!;for(i=3,n-1,P*=P\i);P\n) \\ _M. F. Hasler_, Oct 21 2014
%Y A076041 Cf. A076039, A003462, A076042, A046901.
%K A076041 nice,nonn,easy
%O A076041 1,2
%A A076041 _Amarnath Murthy_, Oct 29 2002
%E A076041 Corrected and extended by Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 20 2003
%E A076041 Edited by _M. F. Hasler_, Oct 21 2014