A098530 - cp's OEIS frontend

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

n	a(n)
1	4
2	4
3	6
4	10
5	12
6	4
7	4
8	42
9	12
10	1
11	16
12	60
13	60
14	4
15	4
16	105
17	164
18	34
19	20
20	162
21	316
22	180
23	6
24	10
25	202
26	672
27	484
28	96

[4, 4, 6, 10, 12, 4, 4, 42, 12, 1, 16, 60, 60, 4, 4, 105, 164, 34, 20, 162, 316, 180, 6, 10, 202, 672, 484, 96]