674641325

Appears in sequences

• Number of words on {1,1,2,2,...,n,n} with longest increasing subsequence of length < n.at n=7A267532
• Number of sequences with n copies each of 1,2,...,7 avoiding the pattern 12...7.at n=2A269125
• Number A(n,k) of sequences with k copies each of 1,2,...,n avoiding the pattern 12...n; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=52A269129