A098529 - cp's OEIS frontend

A098529 Triangle read by rows: T(n,k) counts plane partitions of n+1 that can be 'shrunk' in k ways to a plane partition of n by removing 1 element from it. Equivalently, it counts how many partitions of n+1 have k different partitions of n it just covers.

n	a(n)
0	1
1	3
2	3
3	3
4	6
5	6
6	1
7	3
8	18
9	3
10	9
11	24
12	15
13	3
14	42
15	38
16	3
17	10
18	60
19	69
20	21
21	6
22	72
23	153
24	45
25	6
26	9
27	114
28	220
29	141
30	15
31	1
32	3
33	120
34	399
35	274
36	60
37	3
38	18
39	159
40	558
41	570
42	162
43	12
44	3
45	174
46	834
47	1029
48	399
49	46
50	9
51	267
52	1080
53	1749
54	921
55	138
56	3

[1, 3, 3, 3, 6, 6, 1, 3, 18, 3, 9, 24, 15, 3, 42, 38, 3, 10, 60, 69, 21, 6, 72, 153, 45, 6, 9, 114, 220, 141, 15, 1, 3, 120, 399, 274, 60, 3, 18, 159, 558, 570, 162, 12, 3, 174, 834, 1029, 399, 46, 9, 267, 1080, 1749, 921, 138, 3]

cp's OEIS Frontend

A098529 Triangle read by rows: T(n,k) counts plane partitions of n+1 that can be 'shrunk' in k ways to a plane partition of n by removing 1 element from it. Equivalently, it counts how many partitions of n+1 have k different partitions of n it just covers.

Table of values

List of values