%I M1229 #35 Jan 16 2019 12:09:12
%S 1,2,4,10,30,98,328,1140,4040,14542,53060,195624,727790,2728450,
%T 10296720,39084190,149115456,571504686,2199310460,8494701152,
%U 32919635606,127961125094,498775164568,1949112527750,7634623480172
%N Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,1).
%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 Equals A001335(n+1) / 6 for n > 1.
%Y Cf. A003290, A003291, A005549, A005550, A005551, A005552, A005553.
%K nonn,walk,more
%O 1,2
%A _N. J. A. Sloane_
%E More terms and title improved by _Sean A. Irvine_, Feb 13 2016
%E a(23)-a(24) from _Bert Dobbelaere_, Jan 03 2019
%E a(25) from _Bert Dobbelaere_, Jan 15 2019