Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals.

A047888

Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =5a(8) =2a(9) =1a(10) =1a(11) =14a(12) =6a(13) =2a(14) =1a(15) =1a(16) =42a(17) =23a(18) =6a(19) =2a(20) =1a(21) =1a(22) =132a(23) =103a(24) =24a(25) =6a(26) =2a(27) =1a(28) =1a(29) =429

External references