Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.

A292879

Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.

Terms

    a(0) =1a(1) =2a(2) =30a(3) =3a(4) =90a(5) =540a(6) =4a(7) =180a(8) =2160a(9) =8400a(10) =5a(11) =300a(12) =5400a(13) =42000a(14) =126000a(15) =6a(16) =450a(17) =10800a(18) =126000a(19) =756000a(20) =1905120a(21) =7a(22) =630a(23) =18900a(24) =294000a(25) =2646000a(26) =13335840a(27) =29635200a(28) =8a(29) =840

External references