|
%I #10 Jan 30 2019 14:28:17
%S 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,
%T 13,20,42,32,26,18,14,34,41,31,22,28,38,46,55,68,36,47,39,50,59,69,56,
%U 66,80,45,57,48,40,51,43,54,63,35,64,52,44,75,62,53,65,102,87,73,60
%N 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.
%C Board is numbered as follows:
%C 0 1 3 6 12 17 .
%C 2 4 7 13 18 .
%C 5 10 14 19 .
%C 11 15 20 .
%C 16 21 .
%C 22 .
%C .
%C Coincides with A316334 for the first 2402 terms.
%H Daniël Karssen, <a href="/A323811/b323811.txt">Table of n, a(n) for n = 0..99999</a>
%H Daniël Karssen, <a href="/A323811/a323811.svg">Figure showing the first 1e5 steps of the sequence</a>
%Y The sequences involved in this set of related sequences are A316588, A316328, A316334, A316667, A323808, A323809, A323810, and A323811.
%K nonn
%O 0,2
%A _Daniël Karssen_, Jan 28 2019
|
