login

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”).

A005549
Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,3).
(Formerly M4842)
7
1, 12, 54, 188, 636, 2168, 7556, 26826, 96724, 353390, 1305126, 4864450, 18272804, 69103526, 262871644, 1005137688, 3860909698, 14890903690, 57641869140, 223864731680, 872028568182, 3406103773674, 13337263822236
OFFSET
3,2
COMMENTS
The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
KEYWORD
nonn,walk,more
EXTENSIONS
More terms and improved title from Sean A. Irvine, Feb 14 2016
a(23)-a(25) from Bert Dobbelaere, Jan 15 2019
STATUS
approved