29445

Appears in sequences

• a(n) = ceiling(10000*log(n)).at n=18A004245
• a(n) = T(n,n-5), array T as in A055807.at n=23A055810
• Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; the n-th Fibonacci number is in antidiagonal a(n).at n=42A057042
• a(n) = n*(2*n^2 + 5*n + 13)/2.at n=30A163655
• Number of permutations in S_n containing exactly 2 increasing subsequences of length 5.at n=8A224250
• Number of length n+2 0..2 arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=7A253123
• T(n,k)=Number of length n+2 0..k arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=43A253129