A323811 Squares visited by a knight on a diagonally numbered board and moving to the lowest available unvisited square at each step and if no unvisited squares are available move one step back.

0, 7, 5, 1, 11, 8, 3, 2, 12, 6, 4, 9, 25, 17, 10, 29, 23, 15, 37, 30, 21, 16, 24, 19, 27, 33, 13, 20, 42, 32, 26, 18, 14, 34, 41, 31, 22, 28, 38, 46, 55, 68, 36, 47, 39, 50, 59, 69, 56, 66, 80, 45, 57, 48, 40, 51, 43, 54, 63, 35, 64, 52, 44, 75, 62, 53, 65, 102, 87, 73, 60

Offset

0,2

Comments

Board is numbered as follows:

0 1 3 6 12 17 .

2 4 7 13 18 .

5 10 14 19 .

11 15 20 .

16 21 .

22 .

.

Coincides with A316334 for the first 2402 terms.

Links

Daniël Karssen, Table of n, a(n) for n = 0..99999

Daniël Karssen, Figure showing the first 1e5 steps of the sequence

Crossrefs

The sequences involved in this set of related sequences are A316588, A316328, A316334, A316667, A323808, A323809, A323810, and A323811.

Sequence in context: A098687 A021137 A330156 * A316334 A196486 A216853

Adjacent sequences: A323808 A323809 A323810 * A323812 A323813 A323814

Keyword

nonn

Author

Daniël Karssen, Jan 28 2019

Status

approved