Number T(n,k) of partitions of n with largest part k where each block of part i with multiplicity j is marked with a word of length i*j over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur exactly once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A364285
Number T(n,k) of partitions of n with largest part k where each block of part i with multiplicity j is marked with a word of length i*j over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur exactly once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =3a(9) =1a(10) =0a(11) =1a(12) =7a(13) =4a(14) =1a(15) =0a(16) =1a(17) =15a(18) =20a(19) =5a(20) =1a(21) =0a(22) =1a(23) =31a(24) =81a(25) =30a(26) =6a(27) =1a(28) =0a(29) =1
External references
- oeis: A364285