A345024 a(n) is the number of maximal chains of labeled chordal graphs with n vertices.

1, 1, 6, 576, 1416960, 120678543360, 455010170456862720, 95371866538619173904056320, 1383866987105877308750365304858542080, 1716187027583005555045945024371317843956845772800, 221917018834976627508152930913765491170568412125060985539788800, 3598055237740601485367382153175891099609454479883844294426214728495086488780800

Offset: 1

Author

Brendan McKay, Jun 05 2021

Keywords

• nonn
• hard

Comments

a(n) is the number of sequences G[0], G[1], ..., G[n(n-1)/2] where each G[i] is a chordal graph with i edges and G[i] is a subgraph of G[i+1] for each i. All graphs are labeled.

Links

• Brendan McKay, Table of n, a(n) for n = 1..13

Crossrefs

Cf. A058862.