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 A092399 #8 Jul 03 2017 16:13:11
%S A092399 1,1,2,-6,-4,-25,-24,-42,336,216,2500,2376,4032,-52416,-33264,-562500,
%T A092399 -532224,-891072,16039296,10112256,225000000,212357376,352864512,
%U A092399 -8115883776,-5096577024,-140625000000,-132511002624,-219128861952,6135608134656,3842819076096,126562500000000
%N A092399 Row 5 of array in A288580.
%D A092399 F. Smarandache, Back and Forth Factorials, Arizona State Univ., Special Collections, 1972.
%H A092399 J. Dezert, ed., <a href="http://www.mathematicsmagazine.com/corresp/J_Dezert/JDezert.htm">Smarandacheials (1)</a>, Mathematics Magazine for Grades 1-12, No. 4, 2004.
%H A092399 J. Dezert, ed., <a href="http://www.mathematicsmagazine.com/corresp/J_Dezert/JDezert2.htm">Smarandacheials (2)</a>, Mathematics Magazine for Grades 1-12, No. 4, 2004.
%F A092399 a(n) = !n!_5 = Prod_{i=0, 1, 2, ... .}_{0<|n-5i|<=n}(n-5i) = n(n-5)(n-10)....
%e A092399 !11!_5 = 11(11-5)(11-10)(11-15)(11-20) = 11(6)(1)(-4)(-9) = 2376.
%p A092399 T:=proc(n,k) local i,p;
%p A092399 p:=1;
%p A092399 for i from 0 to floor(2*n/k) do
%p A092399 if n-k*i <> 0 then p:=p*(n-k*i) fi; od:
%p A092399 p;
%p A092399 end;
%p A092399 r:=k->[seq(T(n,k), n=0..60)]; r(5); # _N. J. A. Sloane_, Jul 03 2017
%Y A092399 Cf. A288580.
%K A092399 sign
%O A092399 0,3
%A A092399 J. Dezert (Jean.Dezert(AT)onera.fr), Mar 21 2004
%E A092399 Entry revised by _N. J. A. Sloane_, Jul 03 2017