A054250 - cp's OEIS frontend

A054250 Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	3
6	1
7	3
8	5
9	8
10	1
11	4
12	7
13	12
14	20
15	1
16	5
17	9
18	16
19	28
20	45
21	1
22	6
23	11
24	20
25	36
26	60
27	95
28	1
29	7
30	13
31	24
32	44
33	75
34	122
35	191
36	1
37	8
38	15
39	28
40	52
41	90
42	149
43	238
44	365
45	1
46	9
47	17
48	32
49	60
50	105
51	176
52	285
53	444
54	676
55	1
56	10
57	19
58	36
59	68
60	120
61	203
62	332
63	523
64	806
65	1211

[1, 1, 1, 1, 2, 3, 1, 3, 5, 8, 1, 4, 7, 12, 20, 1, 5, 9, 16, 28, 45, 1, 6, 11, 20, 36, 60, 95, 1, 7, 13, 24, 44, 75, 122, 191, 1, 8, 15, 28, 52, 90, 149, 238, 365, 1, 9, 17, 32, 60, 105, 176, 285, 444, 676, 1, 10, 19, 36, 68, 120, 203, 332, 523, 806, 1211]

cp's OEIS Frontend

A054250 Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.

Table of values

List of values