login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A361408
Number of connected cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.
4
0, 1, 5, 31, 248, 2382, 27233, 359800, 5364193, 88622485, 1602171855, 31410476113, 663240471075, 15001046054183, 361775504849332, 9266474332849318, 251217335356943672, 7186461542458525108, 216332059500870350414, 6835872042063656823802
OFFSET
1,3
FORMULA
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.
CROSSREFS
Column k=2 of A321304.
Sequence in context: A024451 A046852 A375533 * A056541 A291885 A126121
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Mar 11 2023
STATUS
approved