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 A092398 #16 Mar 26 2023 14:30:55 %S A092398 1,1,-4,-3,-16,-15,144,105,1024,945,-14400,-10395,-147456,-135135, %T A092398 2822400,2027025,37748736,34459425,-914457600,-654729075,-15099494400, %U A092398 -13749310575,442597478400,316234143225,8697308774400,7905853580625,-299195895398400,-213458046676875,-6818690079129600,-6190283353629375 %N A092398 Row 4 of array in A288580. %D A092398 F. Smarandache, Back and Forth Factorials, Arizona State Univ., Special Collections, 1972. %H A092398 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 A092398 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 A092398 a(n) = !n!_4 = Prod_{i=0, 1, 2, ... .}_{0<|n-4i|<=n}(n-4i) = n*(n-4)*(n-8).... %e A092398 !9!_4 = 9*(9-4)*(9-8)*(9-12)*(9-16) = 9*(5)*(1)*(-3)*(-7) = 945. %p A092398 T:=proc(n,k) local i,p; %p A092398 p:=1; %p A092398 for i from 0 to floor(2*n/k) do %p A092398 if n-k*i <> 0 then p:=p*(n-k*i) fi; od: %p A092398 p; %p A092398 end; %p A092398 r:=k->[seq(T(n,k), n=0..60)]; r(4); # _N. J. A. Sloane_, Jul 03 2017 %t A092398 T[n_, k_] := Module[{i, p = 1}, %t A092398 For[i = 0, i <= Floor[2 n/k], i++, %t A092398 If[n - k i != 0, p *= (n - k i)]]; p]; %t A092398 T[_, 0] = 1; %t A092398 a[n_] := T[n, 4]; %t A092398 Table[a[n], {n, 0, 60}] (* _Jean-François Alcover_, Feb 16 2023 *) %Y A092398 Cf. A288580. %K A092398 sign %O A092398 0,3 %A A092398 J. Dezert (Jean.Dezert(AT)onera.fr), Mar 21 2004 %E A092398 Entry revised by _N. J. A. Sloane_, Jul 03 2017