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 A092973 #8 Jul 03 2017 16:11:03
%S A092973 1,1,2,3,-16,-15,-12,-7,-64,-63,-120,-165,2304,2145,1680,945,16384,
%T A092973 16065,30240,40755,-921600,-855855,-665280,-369495,-9437184,-9237375,
%U A092973 -17297280,-23108085,722534400,670134465,518918400,286358625,9663676416,9449834625,17643225600,23454706275,-936404582400
%N A092973 Row 8 of array in A288580.
%D A092973 F. Smarandache, Back and Forth Factorials, Arizona State Univ., Special Collections, 1972.
%H A092973 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 A092973 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 A092973 a(n, k) = !n!_k = Prod_{i=0, 1, 2, .., floor(2n/k)}_{0<|n-i*k|<=n} (n-i*k) = n(n-k)(n-2k)(n-3k)... . k=8.
%p A092973 T:=proc(n,k) local i,p;
%p A092973 p:=1;
%p A092973 for i from 0 to floor(2*n/k) do
%p A092973 if n-k*i <> 0 then p:=p*(n-k*i) fi; od:
%p A092973 p;
%p A092973 end;
%p A092973 r:=k->[seq(T(n,k), n=0..60)]; r(8); # _N. J. A. Sloane_, Jul 03 2017
%o A092973 (PARI) a(n,k)=prod(j=0,(2*n)\k,if(n-k*j==0,1,n-k*j))
%Y A092973 Cf. A288580, A092396, A092397, A092398, A092399, A092971, A092972, A092974.
%K A092973 sign
%O A092973 0,3
%A A092973 Paul D. Hanna, M.L. Perez and _Amarnath Murthy_, Mar 27 2004
%E A092973 Entry revised by _N. J. A. Sloane_, Jul 03 2017