cp's OEIS Frontend

A264753 Irregular triangle read by rows: T(n,k) = A127671(n,k)/A036040(n,k), n >= 1 and 1 <= k <= A000041(n).

%I A264753 #13 Oct 01 2016 16:08:58
%S A264753 1,1,-1,1,-1,2,1,-1,-1,2,-6,1,-1,-1,2,2,-6,24,1,-1,-1,-1,2,2,2,-6,-6,
%T A264753 24,-120,1,-1,-1,-1,2,2,2,2,-6,-6,-6,24,24,-120,720,1,-1,-1,-1,-1,2,2,
%U A264753 2,2,2,-6,-6,-6,-6,-6,24,24,24,-120,-120,720,-5040
%N A264753 Irregular triangle read by rows: T(n,k) = A127671(n,k)/A036040(n,k), n >= 1 and 1 <= k <= A000041(n).
%C A264753 This sequence connects the multinomial coefficients A036040 (M_3) with A127671 (M_5).
%C A264753 The numbers of terms in n-th row is the number of partitions A000041(n). The number of terms T(n, k) with equal values in the n-th row follow the rhythm of A008284(n).
%C A264753 Some row sums are [1, 0, 2, -5, 21, -104, 636, -4511, 36455, -330954, 3334390, -36914039].
%H A264753 Milton Abramowitz and Irene A. Stegun, editors, <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Multinomials: M_1, M_2 and M_3</a>, Handbook of Mathematical Functions, December 1972, pp. 831-2.
%F A264753 T(n, k) = A127671(n, k)/A036040(n, k), n >= 1 and 1 <= k <= A000041(n).
%e A264753 The first few rows of the T(n,k) triangle:
%e A264753 n = 1: 1
%e A264753 n = 2: 1, -1
%e A264753 n = 3: 1, -1, 2
%e A264753 n = 4: 1, -1, -1, 2, -6
%e A264753 n = 5: 1, -1, -1, 2, 2, -6, 24
%e A264753 n = 6: 1, -1, -1, -1, 2, 2, 2, -6, -6, 24, -120
%e A264753 n = 7: 1, -1, -1, -1, 2, 2, 2, 2, -6, -6, -6, 24, 24, -120, 720
%p A264753 nmax:=8: with(combinat): A008284 := proc(n, k) option remember; if k < 0 or n < 0 then 0 elif k = 0 then if n = 0 then 1 else 0 fi else A008284(n-1, k-1) + A008284(n-k, k) fi end: for n from 1 to nmax do p:=0: k:=1: while k < numbpart(n)+1 do p := p+1: k1 := A008284(n, p): while k1 > 0 do A264753(n, k) := (-1)^(p+1)*(p-1)!: k := k+1: k1 := k1-1: od: od: od: seq(seq(A264753(n, k), k = 1..numbpart(n)), n = 1..nmax);
%t A264753 nMax = 8; A008284[n_, k_] := A008284[n, k] = If[k<0 || n<0, 0, If[k == 0, If[n == 0, 1, 0], A008284[n-1, k-1] + A008284[n-k, k]]]; For[n = 1, n <= nMax, n++, p = 0; k = 1; While[k < PartitionsP[n]+1, p = p+1; k1 = A008284[n, p]; While[k1>0, A264753[n, k] = (-1)^(p+1)*(p-1)!; k = k+1; k1 = k1-1]]]; Table[Table[A264753[n, k], {k, 1, PartitionsP[n]}], {n, 1, nMax}] // Flatten (* _Jean-François Alcover_, Oct 01 2016, translated from Maple *)
%Y A264753 Cf. A036040 (M_3), A127671 (M_5), A000041, A008284, A081362.
%Y A264753 Cf. A048996 (M_0), A036038 (M_1), A036039 (M_2), A117506 (M_4).
%K A264753 sign,tabf
%O A264753 1,6
%A A264753 _Johannes W. Meijer_, Jul 12 2016