20117051281
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=33A047909
- Number of words on {1,1,1,2,2,2,...,n,n,n} with longest increasing subsequence of length n.at n=6A047910
- Number of sequences with n copies each of 1,2,...,6 and longest increasing subsequence of length 6.at n=2A268842