Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n).
A294217
Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =4a(7) =4a(8) =2a(9) =1a(10) =11a(11) =12a(12) =8a(13) =2a(14) =1a(15) =34a(16) =60a(17) =43a(18) =15a(19) =3a(20) =1a(21) =156a(22) =378a(23) =360a(24) =121a(25) =25a(26) =3a(27) =1a(28) =1044a(29) =3843
External references
- oeis: A294217