397222288

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=38A047909
• Number of sequences with n copies each of 1, 2, 3 and longest increasing subsequence of length 3.at n=6A047911
• Number of sequences with 7 copies each of 1,2,...,n and longest increasing subsequence of length n.at n=3A268850