cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A360882 Number of unlabeled connected multigraphs with n edges, no cut-points and degree >= 3 at each node, loops allowed.

This page as a plain text file.
%I A360882 #8 Feb 27 2023 11:22:45
%S A360882 0,1,3,5,10,21,45,114,330,1045,3623,13545,53597,223085,969159
%N A360882 Number of unlabeled connected multigraphs with n edges, no cut-points and degree >= 3 at each node, loops allowed.
%F A360882 a(n) = A360871(n) + 1 for n > 1.
%e A360882 The a(3) = 3 multigraphs are:
%e A360882   - a single vertex with 3 loops;
%e A360882   - a triple edge;
%e A360882   - a single edge with a loop at each vertex.
%Y A360882 Cf. A002935, A360863, A360867, A360871.
%Y A360882 Row sums of A360870.
%K A360882 nonn,more
%O A360882 1,3
%A A360882 _Andrew Howroyd_, Feb 27 2023