10258694241
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=31A047909
- Number of sequences with n copies each of 1,2,3,4 and longest increasing subsequence of length 4.at n=4A268840
- Number of sequences with 5 copies each of 1,2,...,n and longest increasing subsequence of length n.at n=4A268848