A325191 - OEIS

A325191

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 1.

0, 0, 2, 0, 3, 3, 0, 4, 6, 4, 0, 5, 10, 10, 5, 0, 6, 15, 20, 15, 6, 0, 7, 21, 35, 35, 21, 7, 0, 8, 28, 56, 70, 56, 28, 8, 0, 9, 36, 84, 126, 126, 84, 36, 9, 0, 10, 45, 120, 210, 252, 210, 120, 45, 10, 0, 11, 55, 165, 330, 462

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

The Heinz numbers of these partitions are given by A325196.

Under the Bulgarian solitaire step, these partitions form cycles of length >= 2. Length >= 2 means not the length=1 self-loop which occurs from the triangular partition when n is a triangular number. See A074909 for self-loops included. - Kevin Ryde, Sep 27 2019

LINKS

Table of n, a(n) for n=0..60.

FindStat, St000380: Half the perimeter of the largest rectangle that fits inside the diagram of an integer partition

FindStat, St000384: The maximal part of the shifted composition of an integer partition

FindStat, St000783: The maximal number of occurrences of a colour in a proper colouring of a Ferrers diagram

Eric Weisstein's World of Mathematics, Graph Distance

FORMULA

Positions of zeros are A000217 = n * (n + 1) / 2.

a(n) = A074909(n) - A010054(n). - Kevin Ryde, Sep 27 2019

EXAMPLE

The a(2) = 2 through a(12) = 10 partitions (empty columns not shown):

(2) (22) (32) (322) (332) (432) (4322) (4332)