cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A376071 Number of (non-null) regular subgraphs of a complete graph having n labeled vertices.

This page as a plain text file.
%I A376071 #27 Oct 02 2024 14:37:48
%S A376071 1,4,11,32,99,452,2829,59728,1548859,168927280,12165067397,
%T A376071 7074423251656,2294426405588381,4218009215702408336,
%U A376071 3810376434461485027083,35102248193591661086986784,156873334244228518638713218203,4144940994226400702145709978496296
%N A376071 Number of (non-null) regular subgraphs of a complete graph having n labeled vertices.
%F A376071 a(n) = Sum_{k=1..n} binomial(n,k)*A295193(k). - _Andrew Howroyd_, Sep 08 2024
%Y A376071 Cf. A295193.
%K A376071 nonn
%O A376071 1,2
%A A376071 _Maharshee K. Shah_, Sep 08 2024
%E A376071 a(9) onwards from _Andrew Howroyd_, Sep 08 2024