80815

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, -1, -1), (-1, 0, 0), (-1, 0, 1), (0, -1, 0), (1, 1, 0)}.at n=10A149234
• Capped binary boundary codes for holeless strictly non-overlapping polyhexes (all orientations and rotations included).at n=39A258002
• The number of vertices inside a cross with width 3 and height n (see Comments in A331455 for definition) formed by the straight line segments mutually connecting all vertices and all points.at n=26A330850