Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #27 Oct 02 2024 14:37:48
%S 1,4,11,32,99,452,2829,59728,1548859,168927280,12165067397,
%T 7074423251656,2294426405588381,4218009215702408336,
%U 3810376434461485027083,35102248193591661086986784,156873334244228518638713218203,4144940994226400702145709978496296
%N Number of (non-null) regular subgraphs of a complete graph having n labeled vertices.
%F a(n) = Sum_{k=1..n} binomial(n,k)*A295193(k). - _Andrew Howroyd_, Sep 08 2024
%Y Cf. A295193.
%K nonn
%O 1,2
%A _Maharshee K. Shah_, Sep 08 2024
%E a(9) onwards from _Andrew Howroyd_, Sep 08 2024