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 into distinct parts; triangle T(n,k), n>=0, k = 1..A000009(n), read by rows.
A370614
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 into distinct parts; triangle T(n,k), n>=0, k = 1..A000009(n), read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =8a(7) =1a(8) =16a(9) =46a(10) =1a(11) =32a(12) =146a(13) =330a(14) =1a(15) =64a(16) =454a(17) =1066a(18) =1374a(19) =1a(20) =128a(21) =1394a(22) =4718a(23) =5658a(24) =10554a(25) =1a(26) =256a(27) =4246a(28) =20266a(29) =23118
External references
- oeis: A370614