Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.
A059441
Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =0a(5) =1a(6) =1a(7) =3a(8) =3a(9) =1a(10) =1a(11) =0a(12) =12a(13) =0a(14) =1a(15) =1a(16) =15a(17) =70a(18) =70a(19) =15a(20) =1a(21) =1a(22) =0a(23) =465a(24) =0a(25) =465a(26) =0a(27) =1a(28) =1a(29) =105
External references
- oeis: A059441