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 A092971 #11 Jul 03 2017 16:13:28
%S A092971 1,1,2,-9,-8,-5,-36,-35,-64,729,640,385,5184,5005,8960,-164025,
%T A092971 -143360,-85085,-1679616,-1616615,-2867200,72335025,63078400,37182145,
%U A092971 967458816,929553625,1640038400,-52732233225,-45921075200,-26957055125,-870712934400,-835668708875,-1469474406400,57425401982025
%N A092971 Row 6 of array in A288580.
%D A092971 F. Smarandache, Back and Forth Factorials, Arizona State Univ., Special Collections, 1972.
%H A092971 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 A092971 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 A092971 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=6.
%p A092971 T:=proc(n,k) local i,p;
%p A092971 p:=1;
%p A092971 for i from 0 to floor(2*n/k) do
%p A092971 if n-k*i <> 0 then p:=p*(n-k*i) fi; od:
%p A092971 p;
%p A092971 end;
%p A092971 r:=k->[seq(T(n,k), n=0..60)]; r(6); # _N. J. A. Sloane_, Jul 03 2017
%o A092971 (PARI) a(n,k)=prod(j=0,(2*n)\k,if(n-k*j==0,1,n-k*j))
%Y A092971 Cf. A288580, A092396, A092397, A092398, A092399, A092972, A092973, A092974.
%K A092971 sign
%O A092971 0,3
%A A092971 Paul D. Hanna and _Amarnath Murthy_, Mar 27 2004
%E A092971 Entry revised by _N. J. A. Sloane_, Jul 03 2017