Triangle read by rows: T(n,k) is the number of labeled threshold graphs on vertex set [n] in which k dominating vertices are added in standard iterative construction, n >= 1 and 0 <= k <= n-1.
A350060
Triangle read by rows: T(n,k) is the number of labeled threshold graphs on vertex set [n] in which k dominating vertices are added in standard iterative construction, n >= 1 and 0 <= k <= n-1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =6a(5) =1a(6) =1a(7) =22a(8) =22a(9) =1a(10) =1a(11) =65a(12) =200a(13) =65a(14) =1a(15) =1a(16) =171a(17) =1265a(18) =1265a(19) =171a(20) =1a(21) =1a(22) =420a(23) =6566a(24) =15050a(25) =6566a(26) =420a(27) =1a(28) =1a(29) =988
External references
- oeis: A350060