The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006815 Related to self-avoiding 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 self-avoiding 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 Table of n, a(n) for n=1..18. S. S. Manna, A. J. Guttmann and A. K. Roy, Diffusion on self-avoiding walk networks, J. Phys. A 22 (1989), 3621-3627. CROSSREFS Cf. A006814, A006816. Sequence in context: A220238 A078798 A027043 * A264690 A241394 A054491 Adjacent sequences: A006812 A006813 A006814 * A006816 A006817 A006818 KEYWORD nonn,walk,more AUTHOR N. J. A. Sloane STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 17:49 EST 2023. Contains 367659 sequences. (Running on oeis4.)