A053466 Number of connected 3-multigraphs on n nodes.

1, 3, 16, 250, 10364, 1590368, 890704748, 1798888780974, 13040687516840812, 341365122121400763818, 32525985067651643920408364, 11367070802646570246017825177796, 14669210743645179982935622385486358396, 70315832651324129302715163143607703940500714

Offset: 1

Author

Vladeta Jovovic, Jan 13 2000

Keywords

• easy
• nonn

Links

• Andrew Howroyd, Table of n, a(n) for n = 1..50
• Marko Riedel, Computation of a recurrence for the number of connected k-multigraphs on n nodes
• Marko Riedel, Maple implementation of a recurrence for the number of connected k-multigraphs on n nodes

Crossrefs

Cf. A053400, A053515.

Formula

Inverse Euler transform of A053400. - Andrew Howroyd, Nov 07 2019

Extensions

Terms a(13) and beyond from Andrew Howroyd, Nov 07 2019