Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).
A324163
Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =3a(9) =1a(10) =0a(11) =0a(12) =12a(13) =0a(14) =1a(15) =0a(16) =0a(17) =60a(18) =70a(19) =15a(20) =1a(21) =0a(22) =0a(23) =360a(24) =0a(25) =465a(26) =0a(27) =1a(28) =0a(29) =0
External references
- oeis: A324163