[seqfan] A construction problem
Christopher Hunt gribble
cgribble263 at btinternet.com
Fri Oct 28 11:34:25 CEST 2011
Let a(n) be the number of plane partitions that can be derived from a linear
(ordinary) partition comprising n distinct parts.
Let these parts be labelled a, b, c, d, ... with a > b > c > d ..., then
a(n) = 1, 2, 4, 11, 26, 74, 198 ., not in the OEIS.
The number of different 2D shapes is the number of linear partitions on n.
Plane partitions are such that its parts are non-increasing along rows and
For example, the possible plane partitions that can be derived from "a b c
are listed below.
a b c d
a c d
a b d
a b c
Does anyone know of an algorithm, program or package that can generate
Is this linked to any other area of combinatorics?
More information about the SeqFan