Number T(n,k) of colored integer partitions of n using all colors of a k-set such that each block of part i with multiplicity j has a pattern of i*j distinct colors in increasing order; triangle T(n,k), k>=0, k<=n<=A024916(k), read by columns.
A326617
Number T(n,k) of colored integer partitions of n using all colors of a k-set such that each block of part i with multiplicity j has a pattern of i*j distinct colors in increasing order; triangle T(n,k), k>=0, k<=n<=A024916(k), read by columns.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =2a(4) =1a(5) =5a(6) =9a(7) =9a(8) =10a(9) =9a(10) =3a(11) =13a(12) =44a(13) =96a(14) =152a(15) =155a(16) =124a(17) =140a(18) =160a(19) =113a(20) =48a(21) =16a(22) =4a(23) =42a(24) =225a(25) =680a(26) =1350a(27) =2180a(28) =3751a(29) =6050
External references
- oeis: A326617