login
Number of regular graphs on n unlabeled nodes with half-edges.
2

%I #7 Mar 13 2020 02:50:54

%S 1,2,4,6,11,16,38,78,304,1672,19630,450154,20198620,1673850034,

%T 252574719718,69216356716672,34559361669877526,31561018687380681802,

%U 52958472442027295300520,163901411216705405946164728,939523329928455089556983977702

%N Number of regular graphs on n unlabeled nodes with half-edges.

%C A half-edge is like a loop except it only adds 1 to the degree of its vertex.

%Y Row sums of A333161.

%Y Cf. A322698, A333159.

%K nonn

%O 0,2

%A _Andrew Howroyd_, Mar 11 2020