

A345676


Number of closedloop selfavoiding paths on a 2dimensional square lattice where each path consists of steps with successive lengths equal to the square numbers, from 1 to n^2.


1



0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 368, 264, 0, 0, 1656, 5104, 0, 0, 62016, 105344, 0, 0, 1046656, 3181104
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,15


COMMENTS

This sequence gives the number of closedloop selfavoiding walks on a 2D square lattice where the walk starts with a step length of 1 which then increments at each step to the next square number until the step length is n^2. No closedloop path is possible until n = 15.
Like A334720 and A335305 the only n values that can form closed loop walks are those which correspond to the indices of even triangular numbers. Curiously though n = 16 walks form no closed loops, even though both n = 15 and n = 16 are indices of such numbers.
As in A010566 all possible paths are counted, including those that are equivalent via rotation and reflection.


LINKS



EXAMPLE

a(1) to a(14) = 0 as no closedloop paths are possible.
a(15) = 32 as there are four different paths which form closed loops, and each of these can be walked in eight different ways on a 2D square lattice. These walks consist of steps with lengths 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225. See the linked text images.


CROSSREFS



KEYWORD

nonn,walk,more


AUTHOR



STATUS

approved



