355906

Appears in sequences

• Number of partitions of n^2 into powers of 2.at n=15A196880
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k triple descents (n>=0,0<=k<=n-3). We say that i is a triple descent of a permutation p if p(i) > p(i+1) > p(i+2) > p(i+3).at n=42A220183
• a(n) = binomial(2*n,n) - ceiling(2^(2*n)/(n+1)).at n=11A282708