39594

Appears in sequences

• Numbers whose base-2 representation has exactly 14 runs.at n=27A043581
• Lexicographical-support sequence T(n,k), n,k nonnegative: total number of checks required by a "lexicographical" algorithm to find out which rows and columns of each of the n by k zero-one matrices are nonzero.at n=38A058547
• a(n) = T(n) concatenated with reverse(T(n)) divided by 11, where T(n) is the n-th triangular number.at n=29A084008
• Structured disdyakis dodecahedral numbers (vertex structure 5).at n=17A100163
• Triangle T(n,k) = A008517(n,k+1)+A008517(n,n+1-k) read by rows.at n=30A156141
• Triangle T(n,k) = A008517(n,k+1)+A008517(n,n+1-k) read by rows.at n=33A156141
• a(n) = 1 + (n-1) + (n-1)*[n/2-1] + (n-1)*[n/2-1]*[n/3-1] + (n-1)*[n/2-1]*[n/3-1]*[n/4-1] +... for n>0 with a(0)=1, where [x] = floor(x).at n=18A207643
• Triangle read by rows: T(n,k) = number of plateau polycubes of width n and volume k.at n=59A232483
• Number of (n+1)X(1+1) 0..3 arrays with no 2X2 subblock having its maximum diagonal element less than the absolute difference of its antidiagonal elements.at n=2A251352
• Number of (n+1)X(3+1) 0..3 arrays with no 2X2 subblock having its maximum diagonal element less than the absolute difference of its antidiagonal elements.at n=0A251354
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having its maximum diagonal element less than the absolute difference of its antidiagonal elements.at n=3A251359
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having its maximum diagonal element less than the absolute difference of its antidiagonal elements.at n=5A251359