%I M3657 #22 Dec 26 2021 21:20:54
%S 4,35,166,633,2276,8107,29086,105460,386320,1428664,5327738,20014741,
%T 75677726,287784832,1099944240,4223170456,16280541834,62992268833,
%U 244536402984,952154191644,3717618386556,14551788319328
%N Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (1,3).
%C The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H D. S. McKenzie, <a href="http://dx.doi.org/10.1088/0305-4470/6/3/009">The end-to-end length distribution of self-avoiding walks</a>, J. Phys. A 6 (1973), 338-352.
%H G. Nebe and N. J. A. Sloane, <a href="http://www.math.rwth-aachen.de/~Gabriele.Nebe/LATTICES/A2.html">Home page for hexagonal (or triangular) lattice A2</a>
%Y Cf. A001335, A003289, A003290, A003291, A005549, A005550, A005551, A005553.
%K nonn,walk,more
%O 4,1
%A _N. J. A. Sloane_
%E More terms and title improved by _Sean A. Irvine_, Feb 15 2016
%E a(23)-a(25) from _Bert Dobbelaere_, Jan 15 2019