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.

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.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =3a(4) =3a(5) =5a(6) =9a(7) =14a(8) =20a(9) =26a(10) =38a(11) =53a(12) =75a(13) =101a(14) =132a(15) =175a(16) =229a(17) =301a(18) =394a(19) =509a(20) =650a(21) =826a(22) =1043a(23) =1315a(24) =1656a(25) =2074a(26) =2590a(27) =3218a(28) =3975a(29) =4896

External references