A256895 - cp's OEIS frontend

A256895 Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} j!C(n-1,j-1)T(n-j,k-1) if k != 0 else 1, n>=0, 0<=k<=n.

n	a(n)
0	1
1	1
2	1
3	1
4	3
5	1
6	1
7	11
8	7
9	1
10	1
11	49
12	47
13	13
14	1
15	1
16	261
17	341
18	139
19	21
20	1
21	1
22	1631
23	2731
24	1471
25	329
26	31
27	1
28	1
29	11743
30	24173
31	16213
32	4789
33	671
34	43
35	1
36	1
37	95901
38	235463
39	189373
40	69441
41	12881
42	1231
43	57
44	1
45	1
46	876809
47	2509621
48	2357503
49	1032245
50	237961
51	30169
52	2087
53	73
54	1

[1, 1, 1, 1, 3, 1, 1, 11, 7, 1, 1, 49, 47, 13, 1, 1, 261, 341, 139, 21, 1, 1, 1631, 2731, 1471, 329, 31, 1, 1, 11743, 24173, 16213, 4789, 671, 43, 1, 1, 95901, 235463, 189373, 69441, 12881, 1231, 57, 1, 1, 876809, 2509621, 2357503, 1032245, 237961, 30169, 2087, 73, 1]

cp's OEIS Frontend

A256895 Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} j!C(n-1,j-1)T(n-j,k-1) if k != 0 else 1, n>=0, 0<=k<=n.

Table of values

List of values

cp's OEIS Frontend

A256895 Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} j!*C(n-1,j-1)*T(n-j,k-1) if k != 0 else 1, n>=0, 0<=k<=n.

Table of values

List of values

A256895 Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} j!C(n-1,j-1)T(n-j,k-1) if k != 0 else 1, n>=0, 0<=k<=n.