329126
domain: N
Appears in sequences
- Triangle T read by rows: T(m,n) = number of convex polyominoes with an m+1 X n+1 minimal bounding rectangle, m > 0, n <= m.at n=14A093118
- Number of convex polyominoes with an n+1 X n+1 minimal bounding square.at n=4A093120
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, 1, -1), (0, 1, 0), (1, -1, 1)}.at n=11A148490