1100902

Appears in sequences

• Number of permutations of length n with longest increasing subsequence of length 5.at n=5A001456
• 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=49A047874
• 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=50A126065
• Number of permutations of [2n] with longest increasing subsequence of length n.at n=5A267433