|
%I M4187 #27 Dec 30 2018 03:43:13
%S 1,6,29,108,393,1298,4271,13312,41469,125042,376747,1111144,3274475,
%T 9505054,27573041,79086964,226727667,644301026,1830188555,5162408200,
%U 14556754485,40811281170
%N Related to self-avoiding walks on square lattice.
%C After constructing a self-avoiding walk, bridge together all adjacent neighboring sites on the walk. This sequence is sum of the total number of links after adding bridges across all walks of length n. - _Sean A. Irvine_, Aug 09 2017
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A. J. Guttmann and J. Wang, <a href="/A006814/a006814.pdf">The extension of self-avoiding random walk series in 2 dimensions</a>, Preprint. (Annotated scanned copy)
%H B. D. Hughes, Random Walks and Random Environments, vol. 1, Oxford 1995, <a href="/A001334/a001334.pdf">Tables and references for self-avoiding walks counts</a> [Annotated scanned copy of several pages of a preprint or a draft of chapter 7 "The self-avoiding walk"]
%H S. S. Manna, A. J. Guttmann and A. K. Roy, <a href="https://doi.org/10.1088/0305-4470/22/17/026">Diffusion on self-avoiding walk networks</a>, J. Phys. A 22 (1989), 3621-3627.
%Y Cf. A001411, A006814, A006815.
%K nonn,walk
%O 1,2
%A _N. J. A. Sloane_
%E a(19)-a(22) from _Sean A. Irvine_, Aug 09 2017
|
