Triangular array read by rows. T(n,k) is the number of unlabeled graphs on n nodes that have exactly k distinct components (n >= 1).
A217955
Triangular array read by rows. T(n,k) is the number of unlabeled graphs on n nodes that have exactly k distinct components (n >= 1).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =6a(5) =2a(6) =21a(7) =8a(8) =112a(9) =28a(10) =2a(11) =853a(12) =145a(13) =7a(14) =11117a(15) =1022a(16) =34a(17) =261080a(18) =12320a(19) =181a(20) =1a(21) =11716571a(22) =274785a(23) =1266a(24) =12a(25) =1006700565a(26) =12007355a(27) =14106a(28) =63a(29) =164059830476
External references
- oeis: A217955