102011
domain: N
Appears in sequences
- a(n) = n*(n+1)*(n^2+5*n+18)/24.at n=37A051744
- Number of words on {1,1,2,2,3,3,...,n,n} avoiding the pattern 12345.at n=5A266735
- Number A(n,k) of words on {1,1,2,2,...,n,n} with longest increasing subsequence of length <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=50A267479
- Number of words on {1,1,2,2,...,n,n} with longest increasing subsequence of length < n.at n=5A267532
- Number of sequences with n copies each of 1,2,...,5 avoiding the pattern 12...5.at n=2A269123
- 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=33A269129