Total number of sequences with p_j copies of j and longest increasing subsequence of length k summed over all partitions [p_1, p_2, ..., p_k] of n into distinct parts.
A268700
Total number of sequences with p_j copies of j and longest increasing subsequence of length k summed over all partitions [p_1, p_2, ..., p_k] of n into distinct parts.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =4a(5) =14a(6) =46a(7) =111a(8) =330a(9) =1614a(10) =7348a(11) =21340a(12) =98145a(13) =379405a(14) =2633085a(15) =14871033a(16) =57284558a(17) =278927415a(18) =1609313975a(19) =8289565670a(20) =74945364815a(21) =522977754235
External references
- oeis: A268700