20380

Appears in sequences

• Number of ways to place zero or more nonadjacent 0,0 1,0 1,1 2,1 3,1 3,2 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155266
• Maximum number of tatami tilings of any m X m square region with exactly n horizontal dimers and m monomers.at n=28A192096
• Number of ballot sequences of length n with exactly 4 fixed points.at n=13A238979
• Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock diagonal maximum plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=1A254182
• Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock diagonal maximum plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=1A254183
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal maximum plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=4A254189
• Number of (2+2)X(n+2) 0..1 arrays with every 3X3 subblock diagonal maximum plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=1A254190
• Triangle read by rows: T(p,q) is the number of B-diagrams G such that omega(G)=p half edges and h_f(G)=q non-used outer non-cut half edges.at n=17A265199