A325187 - cp's OEIS frontend

A325187 Number of integer partitions of n such that the upper-left square of the Young diagram has strictly greater graph-distance from the lower-right boundary than any other square.

n	a(n)
1	1
2	0
3	1
4	3
5	3
6	5
7	9
8	14
9	20
10	26
11	38
12	53
13	75
14	101
15	132
16	175
17	229
18	301
19	394
20	509
21	650
22	826
23	1043
24	1315
25	1656
26	2074
27	2590
28	3218
29	3975
30	4896
31	6008
32	7361
33	8989
34	10960
35	13323
36	16159
37	19531
38	23553
39	28323
40	34002
41	40723
42	48694
43	58115
44	69249
45	82350
46	97766
47	115832

[1, 0, 1, 3, 3, 5, 9, 14, 20, 26, 38, 53, 75, 101, 132, 175, 229, 301, 394, 509, 650, 826, 1043, 1315, 1656, 2074, 2590, 3218, 3975, 4896, 6008, 7361, 8989, 10960, 13323, 16159, 19531, 23553, 28323, 34002, 40723, 48694, 58115, 69249, 82350, 97766, 115832]

cp's OEIS Frontend

A325187 Number of integer partitions of n such that the upper-left square of the Young diagram has strictly greater graph-distance from the lower-right boundary than any other square.

Table of values

List of values