A257566 - cp's OEIS frontend

A257566 Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} P(n,j)*T(n-j,k-1) if k>0 else 0^n where P(n,j) is the number of j-partitions of n; for n>=0 and 0<=k<=n.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	1
6	0
7	3
8	4
9	1
10	0
11	5
12	13
13	7
14	1
15	0
16	7
17	30
18	30
19	10
20	1
21	0
22	11
23	76
24	119
25	65
26	14
27	1
28	0
29	15
30	152
31	357
32	306
33	113
34	18
35	1
36	0
37	22
38	330
39	1119
40	1375
41	746
42	193
43	23
44	1
45	0
46	30
47	633
48	2973
49	5059
50	3888
51	1497
52	295
53	28
54	1
55	0
56	42
57	1245
58	8036
59	18605
60	19423
61	10298
62	2930
63	447
64	34
65	1

[1, 0, 1, 0, 2, 1, 0, 3, 4, 1, 0, 5, 13, 7, 1, 0, 7, 30, 30, 10, 1, 0, 11, 76, 119, 65, 14, 1, 0, 15, 152, 357, 306, 113, 18, 1, 0, 22, 330, 1119, 1375, 746, 193, 23, 1, 0, 30, 633, 2973, 5059, 3888, 1497, 295, 28, 1, 0, 42, 1245, 8036, 18605, 19423, 10298, 2930, 447, 34, 1]

cp's OEIS Frontend

A257566 Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} P(n,j)*T(n-j,k-1) if k>0 else 0^n where P(n,j) is the number of j-partitions of n; for n>=0 and 0<=k<=n.

Table of values

List of values