40270

Appears in sequences

• Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n).at n=33A047887
• Number of permutations in S_n with longest increasing subsequence of length <= 6.at n=8A052399
• a(n) = binomial(n+5,6) + binomial(n+3,3) + binomial(n+2,3) + binomial(n-1,1).at n=15A105450
• Triangle, read by rows, T(n, k) = 2*binomial(n, k)*binomial(n+1, k)/(k+1) - (k! - n! + (n-k)!).at n=38A176152
• Triangle, read by rows, T(n, k) = 2*binomial(n, k)*binomial(n+1, k)/(k+1) - (k! - n! + (n-k)!).at n=42A176152
• Number of 6-cycles in the n X n king graph.at n=19A288920
• Irregular triangle read by rows: T(n,k) is the number of endofunctions on [n] whose third-largest component has size exactly k; n >= 0, 0 <= k <= floor(n/3).at n=9A350080
• Triangle read by rows: T(n,k) is the number of endofunctions on [n] whose third-smallest component has size exactly k; n >= 0, 0 <= k <= max(0,n-2).at n=12A350081
• a(n) = Sum_{k=0..floor(n/5)} Stirling1(n - 4*k,k).at n=13A357920
• Consecutive states of the linear congruential pseudo-random number generator (1093*s + 18257) mod 86436 when started at s=1.at n=33A385340