login

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

Number of bicolored connected cubic graphs on 2n unlabeled vertices with n vertices of each color.
2

%I #7 Mar 11 2023 18:26:35

%S 1,0,1,5,63,1052,27336,882321,34455134,1558650424,80016369538,

%T 4589908631503,290839634055722,20171917072658395,1519875854413728667,

%U 123616508830454828043,10794216583730162449785,1007179737486515827821590,100007950522974604304016627,10529173417583858651114779790,1171605981584666223513790021758

%N Number of bicolored connected cubic graphs on 2n unlabeled vertices with n vertices of each color.

%C Adjacent vertices may have the same color.

%e a(1) = 1 since the only cubic graph on 4 vertices is the complete graph. The bicolored graphs are indistinguishable whichever 2 vertices are colored in the first color.

%Y Central coefficients of A321304.

%Y Cf. A002851, A361407, A361408.

%K nonn

%O 0,4

%A _Andrew Howroyd_, Mar 11 2023