|
|
A144633
|
|
Triangle of 3-restricted Stirling numbers of the first kind (T(n,k), 0 <= k <= n), read by rows.
|
|
8
|
|
|
1, 0, 1, 0, -1, 1, 0, 2, -3, 1, 0, -5, 11, -6, 1, 0, 10, -45, 35, -10, 1, 0, 35, 175, -210, 85, -15, 1, 0, -910, -315, 1225, -700, 175, -21, 1, 0, 11935, -6265, -5670, 5565, -1890, 322, -28, 1, 0, -134750, 139755, -5005, -39270, 19425, -4410, 546, -36, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,8
|
|
COMMENTS
|
Definition: take the triangle in A144385, write it as an (infinite) upper triangular square matrix, invert it and transpose it.
The Bell transform of A144636(n+1). Also the inverse Bell transform of the sequence "g(n) = 1 if n<3 else 0". For the definition of the Bell transform see A264428. - Peter Luschny, Jan 19 2016
|
|
REFERENCES
|
J. Y. Choi and J. D. H. Smith, On the combinatorics of multi-restricted numbers, Ars. Com., 75(2005), pp. 44-63.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
0, 1;
0, -1, 1;
0, 2, -3, 1;
0, -5, 11, -6, 1;
0, 10, -45, 35, -10, 1;
0, 35, 175, -210, 85, -15, 1;
0, -910, -315, 1225, -700, 175, -21, 1;
|
|
MAPLE
|
A:= proc(n, k) option remember; if n=k then 1 elif k<n or n<1 then 0 else A(n-1, k-1) +(k-1) *A(n-1, k-2) +(k-1) *(k-2) *A(n-1, k-3)/2 fi end:
M:= proc(n) option remember; Matrix(n+1, (i, j)-> A(i-1, j-1))^(-1) end:
T:= (n, k)-> M(n+1)[k+1, n+1]:
|
|
MATHEMATICA
|
max = 10; t[n_, n_] = 1; t[n_ /; n >= 0, k_] /; (0 <= k <= 3*n) := t[n, k] = t[n-1, k-1] + (k-1)*t[n-1, k-2] + (1/2)*(k-1)*(k-2)*t[n-1, k-3]; t[_, _] = 0; A144633 = Table[t[n, k], {n, 0, max}, {k, 0, max}] // Inverse // Transpose; Table[A144633[[n, k]], {n, 1, max}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jan 14 2014 *)
|
|
PROG
|
(Sage) # uses[bell_matrix from A264428]
|
|
CROSSREFS
|
For another version of this triangle see A144634.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|