132688

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, 0), (-1, 1, -1), (1, 0, 1), (1, 1, 0), (1, 1, 1)}.at n=8A151215
• On a spirally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped, or -1 if it never gets trapped.at n=8A323469
• Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates.at n=28A323749