Triangular array read by rows: T(n,k) (n >= 2, 1 <= k <= n) = number of partitions of k white balls and n-k black balls in which each part has at least one ball of each color. Also limit of the joint major-index / inversion polynomial for permutations of n elements, as n becomes infinite.

A090806

Triangular array read by rows: T(n,k) (n >= 2, 1 <= k <= n) = number of partitions of k white balls and n-k black balls in which each part has at least one ball of each color. Also limit of the joint major-index / inversion polynomial for permutations of n elements, as n becomes infinite.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =2a(8) =2a(9) =1a(10) =1a(11) =3a(12) =4a(13) =3a(14) =1a(15) =1a(16) =3a(17) =5a(18) =5a(19) =3a(20) =1a(21) =1a(22) =4a(23) =7a(24) =9a(25) =7a(26) =4a(27) =1a(28) =1a(29) =4

External references