login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003289 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,1).
(Formerly M1229)
8
1, 2, 4, 10, 30, 98, 328, 1140, 4040, 14542, 53060, 195624, 727790, 2728450, 10296720, 39084190, 149115456, 571504686, 2199310460, 8494701152, 32919635606, 127961125094, 498775164568, 1949112527750, 7634623480172 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,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).
LINKS
D. S. McKenzie, The end-to-end length distribution of self-avoiding walks, J. Phys. A 6 (1973), 338-352.
CROSSREFS
Equals A001335(n+1) / 6 for n > 1.
Sequence in context: A362637 A149835 A149836 * A087161 A372018 A360814
KEYWORD
nonn,walk,more
AUTHOR
EXTENSIONS
More terms and title improved by Sean A. Irvine, Feb 13 2016
a(23)-a(24) from Bert Dobbelaere, Jan 03 2019
a(25) from Bert Dobbelaere, Jan 15 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 13:53 EDT 2024. Contains 372387 sequences. (Running on oeis4.)