Triangle read by rows. T(n,k) is the number of labeled threshold graphs on n vertices with k components, for 1 <= k <= n.
A348436
Triangle read by rows. T(n,k) is the number of labeled threshold graphs on n vertices with k components, for 1 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =3a(5) =1a(6) =23a(7) =16a(8) =6a(9) =1a(10) =166a(11) =115a(12) =40a(13) =10a(14) =1a(15) =1437a(16) =996a(17) =345a(18) =80a(19) =15a(20) =1a(21) =14512a(22) =10059a(23) =3486a(24) =805a(25) =140a(26) =21a(27) =1a(28) =167491a(29) =116096
External references
- oeis: A348436