login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005551 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,4).
(Formerly M5090)
7
1, 20, 130, 576, 2218, 8170, 29830, 109192, 402258, 1492746, 5578742, 20986424, 79420122, 302175648, 1155298598, 4436375790, 17103294308, 66174208076, 256870951048, 1000080994758, 3904276709604, 15280413966512 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,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

Table of n, a(n) for n=4..25.

D. S. McKenzie, The end-to-end length distribution of self-avoiding walks, J. Phys. A 6 (1973), 338-352.

G. Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2

CROSSREFS

Cf. A001335, A003289, A003290, A003291, A005549, A005550, A005552, A005553.

Sequence in context: A125330 A126488 A304507 * A006417 A156392 A219574

Adjacent sequences:  A005548 A005549 A005550 * A005552 A005553 A005554

KEYWORD

nonn,walk,more

AUTHOR

N. J. A. Sloane.

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 12 17:06 EST 2019. Contains 329058 sequences. (Running on oeis4.)