Irregular triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with color scheme given by the partitions of n in canonical ordering.

A328773

Irregular triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with color scheme given by the partitions of n in canonical ordering.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =4a(4) =16a(5) =36a(6) =64a(7) =218a(8) =752a(9) =1104a(10) =2112a(11) =4096a(12) =9608a(13) =45960a(14) =90416a(15) =178944a(16) =266496a(17) =528384a(18) =1048576a(19) =1540944a(20) =9133760a(21) =22692704a(22) =45277312a(23) =30194176a(24) =90196736a(25) =180011008a(26) =135032832a(27) =269500416a(28) =537919488a(29) =1073741824

External references