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

A281944

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

Terms

    a(0) =1a(1) =2a(2) =14a(3) =3a(4) =42a(5) =150a(6) =4a(7) =84a(8) =600a(9) =1560a(10) =5a(11) =140a(12) =1500a(13) =7800a(14) =16800a(15) =6a(16) =210a(17) =3000a(18) =23400a(19) =100800a(20) =191520a(21) =7a(22) =294a(23) =5250a(24) =54600a(25) =352800a(26) =1340640a(27) =2328480a(28) =8a(29) =392

External references