A291117 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	3
7	2
8	1
9	1
10	7
11	8
12	4
13	1
14	1
15	15
16	30
17	20
18	7
19	1
20	1
21	31
22	104
23	102
24	46
25	11
26	1
27	1
28	63
29	342
30	496
31	300
32	96
33	16
34	1
35	1
36	127
37	1088
38	2294
39	1891
40	786
41	183
42	22
43	1
44	1
45	255
46	3390
47	10200
48	11417
49	6167
50	1862
51	323
52	29
53	1
54	1
55	511
56	10424
57	44062
58	66256
59	46417
60	17801
61	4040
62	535
63	37
64	1
65	1
66	1023
67	31782
68	186416
69	372190
70	336022
71	162372
72	46425
73	8127
74	841
75	46
76	1

[1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 7, 8, 4, 1, 1, 15, 30, 20, 7, 1, 1, 31, 104, 102, 46, 11, 1, 1, 63, 342, 496, 300, 96, 16, 1, 1, 127, 1088, 2294, 1891, 786, 183, 22, 1, 1, 255, 3390, 10200, 11417, 6167, 1862, 323, 29, 1, 1, 511, 10424, 44062, 66256, 46417, 17801, 4040, 535, 37, 1, 1, 1023, 31782, 186416, 372190, 336022, 162372, 46425, 8127, 841, 46, 1]

cp's OEIS Frontend

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

Table of values

List of values