A291119 - cp's OEIS frontend

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

n	a(n)
0	1
1	2
2	1
3	1
4	1
5	2
6	2
7	1
8	1
9	1
10	5
11	6
12	4
13	2
14	1
15	1
16	11
17	21
18	17
19	9
20	4
21	1
22	1
23	23
24	72
25	78
26	47
27	21
28	7
29	1
30	1
31	47
32	237
33	361
34	265
35	128
36	47
37	11
38	1
39	1
40	95
41	756
42	1634
43	1533
44	847
45	337
46	97
47	16
48	1
49	1
50	191
51	2361
52	7197
53	8819
54	5826
55	2571
56	836
57	184
58	22
59	1
60	1
61	383
62	7272
63	30958
64	49807
65	40433
66	20419
67	7372
68	1927
69	324
70	29
71	1
72	1
73	767
74	22197
75	130721
76	275445
77	278380
78	165103
79	66809
80	19794
81	4122
82	536
83	37
84	1

[1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 5, 6, 4, 2, 1, 1, 11, 21, 17, 9, 4, 1, 1, 23, 72, 78, 47, 21, 7, 1, 1, 47, 237, 361, 265, 128, 47, 11, 1, 1, 95, 756, 1634, 1533, 847, 337, 97, 16, 1, 1, 191, 2361, 7197, 8819, 5826, 2571, 836, 184, 22, 1, 1, 383, 7272, 30958, 49807, 40433, 20419, 7372, 1927, 324, 29, 1, 1, 767, 22197, 130721, 275445, 278380, 165103, 66809, 19794, 4122, 536, 37, 1]

cp's OEIS Frontend

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

Table of values

List of values