154594

Appears in sequences

• Starting at n, a(n) is the number of times we move from a negative position to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=30A324683
• Number of disjoint-path coverings for 2 X n rectangular grids, admitting zero-length paths.at n=6A380451