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”).
%I #20 Nov 30 2023 02:34:52
%S 1,3,16,250,10364,1590368,890704748,1798888780974,13040687516840812,
%T 341365122121400763818,32525985067651643920408364,
%U 11367070802646570246017825177796,14669210743645179982935622385486358396,70315832651324129302715163143607703940500714
%N Number of connected 3-multigraphs on n nodes.
%H Andrew Howroyd, <a href="/A053466/b053466.txt">Table of n, a(n) for n = 1..50</a>
%H Marko Riedel, <a href="/A053466/a053466_1.pdf">Computation of a recurrence for the number of connected k-multigraphs on n nodes</a>
%H Marko Riedel, <a href="/A053466/a053466_1.maple.txt">Maple implementation of a recurrence for the number of connected k-multigraphs on n nodes</a>
%F Inverse Euler transform of A053400. - _Andrew Howroyd_, Nov 07 2019
%Y Cf. A053400, A053515.
%K easy,nonn
%O 1,2
%A _Vladeta Jovovic_, Jan 13 2000
%E Terms a(13) and beyond from _Andrew Howroyd_, Nov 07 2019