|
|
A144643
|
|
Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3 or 4 (n >= 0, 0 <= k <= 4n).
|
|
7
|
|
|
1, 0, 1, 1, 1, 1, 0, 0, 1, 3, 7, 15, 25, 35, 35, 0, 0, 0, 1, 6, 25, 90, 280, 770, 1855, 3675, 5775, 5775, 0, 0, 0, 0, 1, 10, 65, 350, 1645, 6930, 26425, 90475, 275275, 725725, 1576575, 2627625, 2627625, 0, 0, 0, 0, 0, 1, 15, 140, 1050, 6825, 39795, 211750, 1033725, 4629625
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,10
|
|
LINKS
|
|
|
FORMULA
|
T(n, k) = Sum_{j=0..3} binomial(k-1, j) * T(n-1, k-j-1), with T(n, n) = 1, T(n, k) = 0 if n < 1 or n > k.
Sum_{k=0..4*n} T(n, k) = A144508(n).
|
|
EXAMPLE
|
Irregular triangle begins:
1;
0, 1, 1, 1, 1;
0, 0, 1, 3, 7, 15, 25, 35, 35;
0, 0, 0, 1, 6, 25, 90, 280, 770, 1855, 3675, 5775, 5775;
...
|
|
MAPLE
|
T := proc(n, k) option remember;
if n = k then 1;
elif k < n then 0;
elif n < 1 then 0;
else T(n - 1, k - 1) + (k - 1)*T(n - 1, k - 2) + 1/2*(k - 1)*(k - 2)*T(n - 1, k - 3) + 1/6*(k - 1)*(k - 2)*(k - 3)*T(n - 1, k - 4);
end if;
end proc;
|
|
MATHEMATICA
|
T[n_, k_]:= T[n, k]= Which[n==k, 1, k<n, 0, n<1, 0, True, T[n-1, k-1] + (k-1)*T[n-1, k-2] + 1/2*(k-1)*(k-2)*T[n-1, k-3] + 1/6*(k-1)*(k-2)*(k-3)*T[n-1, k-4]]; Table[T[n, k], {n, 0, 5}, {k, 0, 4n}]//Flatten (* Jean-François Alcover, Mar 20 2014, after Maple *)
Table[BellY[k, n, {1, 1, 1, 1}], {n, 0, 12}, {k, 0, 4*n}]]//Flatten (* G. C. Greubel, Oct 11 2023 *)
|
|
PROG
|
(Magma)
function t(n, k)
if k eq n then return 1;
elif k le n-1 or n le 0 then return 0;
else return (&+[Binomial(k-1, j)*t(n-1, k-j-1): j in [0..3]]);
end if;
end function;
(SageMath)
@CachedFunction
def t(n, k):
if (k==n): return 1
elif (k<n or n<1): return 0
else: return sum(binomial(k-1, j)*t(n-1, k-j-1) for j in range(4))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|