A291118 - cp's OEIS frontend

A291118 Triangle read by rows: T(n,k) number of ways of partitioning the (n+3)-element multiset {1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 3.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	1
8	4
9	4
10	2
11	1
12	1
13	9
14	14
15	9
16	4
17	1
18	1
19	19
20	49
21	43
22	21
23	7
24	1
25	1
26	39
27	164
28	206
29	123
30	47
31	11
32	1
33	1
34	79
35	529
36	957
37	741
38	331
39	97
40	16
41	1
42	1
43	159
44	1664
45	4294
46	4409
47	2397
48	829
49	184
50	22
51	1
52	1
53	319
54	5149
55	18713
56	25551
57	17353
58	7105
59	1919
60	324
61	29
62	1
63	1
64	639
65	15764
66	79746
67	144043
68	123523
69	60795
70	19405
71	4113
72	536
73	37
74	1
75	1
76	1279
77	47929
78	334237
79	792561
80	859327
81	514081
82	193530
83	49002
84	8218
85	842
86	46
87	1

[1, 1, 1, 1, 2, 1, 1, 1, 4, 4, 2, 1, 1, 9, 14, 9, 4, 1, 1, 19, 49, 43, 21, 7, 1, 1, 39, 164, 206, 123, 47, 11, 1, 1, 79, 529, 957, 741, 331, 97, 16, 1, 1, 159, 1664, 4294, 4409, 2397, 829, 184, 22, 1, 1, 319, 5149, 18713, 25551, 17353, 7105, 1919, 324, 29, 1, 1, 639, 15764, 79746, 144043, 123523, 60795, 19405, 4113, 536, 37, 1, 1, 1279, 47929, 334237, 792561, 859327, 514081, 193530, 49002, 8218, 842, 46, 1]

cp's OEIS Frontend

A291118 Triangle read by rows: T(n,k) number of ways of partitioning the (n+3)-element multiset {1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 3.

Table of values

List of values