

A006815


Related to selfavoiding walks on square lattice.
(Formerly M4157)


2



1, 6, 23, 84, 283, 930, 2921, 9096, 27507, 82930, 244819, 722116, 2096603, 6087290, 17458887, 50090544, 142317089, 404543142
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

After constructing a selfavoiding walk, bridge together all adjacent neighboring sites on the walk. a(n) is the sum of the lengths of the shortest path in each of the resulting structures from beginning to end (i.e., using the original path and any bridges), across all walks of length n. My attempt to compute this sequence diverges from the listed terms at n=9, for which I get a(9)=27511, a(10)=82938, ....  Sean A. Irvine, Aug 09 2017


REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS



CROSSREFS



KEYWORD

nonn,walk,more


AUTHOR



STATUS

approved



