83029
domain: N
Appears in sequences
- Number of permutations of length n with longest increasing subsequence of length 5.at n=4A001456
- 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=40A047874
- Numbers k such that 7*2^k + 5 is prime.at n=26A058595
- 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=40A126065
- Number of n X 3 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=5A239996
- T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=33A240000
- Number of 6Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=2A240005
- a(n) = floor(2^n/(1 - cos(1/n))).at n=8A332430
- Smallest value of the Colijn-Plazzotta rank among n-leaved unlabeled binary rooted trees.at n=43A354970