A325199 - cp's OEIS frontend

A325199 Number of integer partitions of n such that the difference between the length of the minimal triangular partition containing and the maximal triangular partition contained in the Young diagram is 2.

n	a(n)
0	0
1	0
2	0
3	2
4	0
5	2
6	6
7	3
8	2
9	9
10	15
11	12
12	6
13	12
14	27
15	38
16	34
17	22
18	20
19	43
20	74
21	94
22	90
23	67
24	48
25	69
26	130
27	194
28	232
29	230
30	187
31	132
32	129
33	218
34	364
35	497
36	576
37	578
38	498
39	367
40	290
41	378
42	642
43	977
44	1264
45	1435
46	1448
47	1290
48	1000
49	735
50	728

[0, 0, 0, 2, 0, 2, 6, 3, 2, 9, 15, 12, 6, 12, 27, 38, 34, 22, 20, 43, 74, 94, 90, 67, 48, 69, 130, 194, 232, 230, 187, 132, 129, 218, 364, 497, 576, 578, 498, 367, 290, 378, 642, 977, 1264, 1435, 1448, 1290, 1000, 735, 728]

cp's OEIS Frontend

A325199 Number of integer partitions of n such that the difference between the length of the minimal triangular partition containing and the maximal triangular partition contained in the Young diagram is 2.

Table of values

List of values