login

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

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

%I #5 Mar 11 2023 18:26:15

%S 0,1,5,33,257,2443,27682,363759,5405697,89134360,1609418390,

%T 31525697245,665263778962,15039817276939,362579178545598,

%U 9284375250749758,251643492565059981,7197256536139662143,216621907269166632361,6844093745422473471562

%N Number of cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.

%Y Column k=2 of A361361.

%Y Cf. A005638, A361408, A361410.

%K nonn

%O 1,3

%A _Andrew Howroyd_, Mar 11 2023