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.

A361408 Number of connected cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.

This page as a plain text file.
%I A361408 #5 Mar 11 2023 18:26:27
%S A361408 0,1,5,31,248,2382,27233,359800,5364193,88622485,1602171855,
%T A361408 31410476113,663240471075,15001046054183,361775504849332,
%U A361408 9266474332849318,251217335356943672,7186461542458525108,216332059500870350414,6835872042063656823802
%N A361408 Number of connected cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.
%F A361408 G.f.: B(x)/C(x) - (D(x) + D(x^2))/2 where B(x), C(x) and D(x) are the g.f.s of A361411, A005638 and A361407, respectively.
%Y A361408 Column k=2 of A321304.
%Y A361408 Cf. A002851, A005638, A361407, A361411.
%K A361408 nonn
%O A361408 1,3
%A A361408 _Andrew Howroyd_, Mar 11 2023