cp's OEIS Frontend

A092396 Row 2 of array in A288580.

%I A092396 #10 Apr 05 2020 09:34:02
%S A092396 1,-1,-4,9,64,-225,-2304,11025,147456,-893025,-14745600,108056025,
%T A092396 2123366400,-18261468225,-416179814400,4108830350625,106542032486400,
%U A092396 -1187451971330625,-34519618525593600,428670161650355625,13807847410237440000,-189043541287806830625,-6682998146554920960000
%N A092396 Row 2 of array in A288580.
%D A092396 F. Smarandache, Back and Forth Factorials, Arizona State Univ., Special Collections, 1972.
%H A092396 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 A092396 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 A092396 a(n) = !n!_2 = Prod_{i=0, 1, 2, ... .}_{0<|n-2i|<=n}(n-2i) = n(n-2)(n-4)... = (-1)^(Int(n+1)/2) * (n!!)^2
%e A092396 !3!_2 = 3(3-2)(3-4)(3-6) = 9 and !4!_2 = 4(4-2)(4-6)(4-8) = 64.
%p A092396 T:=proc(n,k)  local i,p;
%p A092396 p:=1;
%p A092396 for i from 0 to floor(2*n/k) do
%p A092396 if n-k*i <> 0 then p:=p*(n-k*i) fi; od:
%p A092396 p;
%p A092396 end;
%p A092396 r:=k->[seq(T(n,k), n=0..60)]; r(2); # _N. J. A. Sloane_, Jul 03 2017
%t A092396 T[n_, k_] := Module[{i, p = 1}, For[i = 0, i <= Floor[2n/k], i++, If[n - k i != 0, p *= (n - k i)]]; p]; T[_, 0] = 1;
%t A092396 Table[T[n, 2], {n, 0, 22}] (* _Jean-François Alcover_, Apr 05 2020, after Maple *)
%Y A092396 Cf. A288580, A001818.
%K A092396 sign
%O A092396 0,3
%A A092396 J. Dezert (Jean.Dezert(AT)onera.fr), Mar 21 2004
%E A092396 Entry revised by _N. J. A. Sloane_, Jul 03 2017