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