106294

Appears in sequences

• 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), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=12A148145
• Place n points in general position on each side of a square, and join every pair of the 4*n+4 boundary points by a chord; sequence gives number of regions in the resulting planar graph.at n=10A367121