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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M4842 #23 Dec 26 2021 21:20:30
%S 1,12,54,188,636,2168,7556,26826,96724,353390,1305126,4864450,
%T 18272804,69103526,262871644,1005137688,3860909698,14890903690,
%U 57641869140,223864731680,872028568182,3406103773674,13337263822236
%N Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,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, A005550, A005551, A005552, A005553.
%K nonn,walk,more
%O 3,2
%A _N. J. A. Sloane_
%E More terms and improved title from _Sean A. Irvine_, Feb 14 2016
%E a(23)-a(25) from _Bert Dobbelaere_, Jan 15 2019