162588279629
domain: N
Appears in sequences
- Array read by antidiagonals upwards: h(n,k) = number of sequences with n copies each of 1,2,...,k and longest increasing subsequence of length k (n>=1, k>=1).at n=32A047909
- Number of sequences with n copies each of 1,2,...,5 and longest increasing subsequence of length 5.at n=3A268841
- Number of sequences with 4 copies each of 1,2,...,n and longest increasing subsequence of length n.at n=5A268847