OFFSET
1,2
COMMENTS
The solid partition graph is constructed as a directed graph whose vertices are solid partitions. The root vertex of the graph is the unique solid partition with one node. Given a solid partition, draw on outward directed edge to all solid partitions that can be obtained by the addition of a single node to the solid partition. The depth of a given vertex is given by the number of its nodes.
LINKS
N. Destainville and S. Govindarajan, Estimating the asymptotics of solid partitions, arXiv:1406.5605 [cond-mat.stat-mech], 2014.
EXAMPLE
a(2) = 4 as all four solid partitions of 2 are connected to the root vertex.
CROSSREFS
KEYWORD
nonn,hard
AUTHOR
Suresh Govindarajan, Jun 23 2014
STATUS
approved