Triangle T(n,k) in which row n lists in increasing order the number of acyclic orientations of complete multipartite graphs K_lambda, where lambda is a partition of n; triangle T(n,k), n>=0, k = 1..A000041(n), read by rows.
A372396
Triangle T(n,k) in which row n lists in increasing order the number of acyclic orientations of complete multipartite graphs K_lambda, where lambda is a partition of n; triangle T(n,k), n>=0, k = 1..A000041(n), read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =4a(6) =6a(7) =1a(8) =8a(9) =14a(10) =18a(11) =24a(12) =1a(13) =16a(14) =46a(15) =54a(16) =78a(17) =96a(18) =120a(19) =1a(20) =32a(21) =146a(22) =162a(23) =230a(24) =330a(25) =384a(26) =426a(27) =504a(28) =600a(29) =720
External references
- oeis: A372396