login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A361072
Number of assembly trees for the complete tripartite graph K_{n,n,n}.
2
3, 672, 1065960, 5384957760, 62421991632000, 1384386516152640000, 52302971661503603040000, 3105288818333100374976000000, 273018704366102767367501606400000, 33963457896477610629976094607360000000
OFFSET
1,1
LINKS
Andrew Vince and Miklos Bona, The Number of Ways to Assemble a Graph, arXiv preprint, arXiv:1204.3842 [math.CO], 2012. See Theorem 23.
Andrew Vince and Miklos Bona, The Number of Ways to Assemble a Graph, The Electronic Journal of Combinatorics, Volume 19, Issue 4 (2012), Article P54.
Eric Weisstein's World of Mathematics, Assembly Number
Eric Weisstein's World of Mathematics, Complete Tripartite Graph
MATHEMATICA
Table[n!^3 SeriesCoefficient[1 - Sqrt[(1 - x)^2 + (1 - y)^2 + (1 - z)^2 - 2], {x, 0, n}, {y, 0, n}, {z, 0, n}], {n, 10}]
CROSSREFS
Cf. A217523 (number of assembly trees for K_{n,n})
Sequence in context: A229668 A165343 A278316 * A266639 A203496 A308323
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Mar 01 2023
STATUS
approved