89497

Appears in sequences

• Number of permutations of length n with longest increasing subsequence of length 3.at n=6A001454
• a(n) = Sum_{k=0..floor((n+1)/2)} (k+1) * A008315(n, k).at n=15A027305
• Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).at n=38A047874
• Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-8).at n=8A114360
• Triangle of numbers read by rows: T(n,k) = number of permutations sigma of (1,2,...,n) with n - {length of longest increasing subsequence in sigma} = k (0<=k<=n-1).at n=42A126065
• Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,3,2,1,0 for x=0,1,2,3,4.at n=16A197211
• Row sums of A050157.at n=8A296771