Total number of sequences with c_j copies of j and longest increasing subsequence of length k summed over all compositions [c_1, c_2, ..., c_k] of n into distinct parts.
A268701
Total number of sequences with c_j copies of j and longest increasing subsequence of length k summed over all compositions [c_1, c_2, ..., c_k] of n into distinct parts.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =5a(4) =7a(5) =27a(6) =195a(7) =421a(8) =1619a(9) =8675a(10) =105757a(11) =274029a(12) =1402193a(13) =6625987a(14) =55349787a(15) =975068069a(16) =3137395939a(17) =17960895375a(18) =101880880461a(19) =696011551909
External references
- oeis: A268701