login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
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: A276312 A024451 A046852 * A056541 A291885 A126121
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Mar 11 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 03:54 EDT 2024. Contains 372148 sequences. (Running on oeis4.)