A341101 - cp's OEIS frontend

A341101 T(n, k) = Sum_{j=0..k} binomial(n, k - j)Stirling1(n - k + j, j)(-1)^(n-k). Triangle read by rows, T(n, k) for 0 <= k <= n.

n	a(n)
0	1
1	0
2	2
3	0
4	1
5	4
6	0
7	2
8	6
9	8
10	0
11	6
12	19
13	24
14	16
15	0
16	24
17	80
18	110
19	80
20	32
21	0
22	120
23	418
24	615
25	500
26	240
27	64
28	0
29	720
30	2604
31	4046
32	3570
33	1960
34	672
35	128
36	0
37	5040
38	18828
39	30604
40	28777
41	17360
42	6944
43	1792
44	256
45	0
46	40320
47	154944
48	261656
49	259056
50	167874
51	74592
52	22848
53	4608
54	512

[1, 0, 2, 0, 1, 4, 0, 2, 6, 8, 0, 6, 19, 24, 16, 0, 24, 80, 110, 80, 32, 0, 120, 418, 615, 500, 240, 64, 0, 720, 2604, 4046, 3570, 1960, 672, 128, 0, 5040, 18828, 30604, 28777, 17360, 6944, 1792, 256, 0, 40320, 154944, 261656, 259056, 167874, 74592, 22848, 4608, 512]

cp's OEIS Frontend

A341101 T(n, k) = Sum_{j=0..k} binomial(n, k - j)Stirling1(n - k + j, j)(-1)^(n-k). Triangle read by rows, T(n, k) for 0 <= k <= n.

Table of values

List of values

cp's OEIS Frontend

A341101 T(n, k) = Sum_{j=0..k} binomial(n, k - j)*Stirling1(n - k + j, j)*(-1)^(n-k). Triangle read by rows, T(n, k) for 0 <= k <= n.

Table of values

List of values

A341101 T(n, k) = Sum_{j=0..k} binomial(n, k - j)Stirling1(n - k + j, j)(-1)^(n-k). Triangle read by rows, T(n, k) for 0 <= k <= n.