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!)
A334330 Number of endless self-avoiding walks of length 2*n for the honeycomb lattice. 6

%I #16 Jul 06 2020 02:51:25

%S 1,6,18,60,210,726,2448,8448,28818,98556,336618,1150320,3928944,

%T 13419204,45828192,156512220,534463698,1825120584,6232259412,

%U 21281168202,72666555570,248124503652,847224827676,2892836367066,9877456541376,33725891989626

%N Number of endless self-avoiding walks of length 2*n for the honeycomb lattice.

%H Nathan Clisby, <a href="https://arxiv.org/abs/1302.2796">Endless self-avoiding walks</a>, arXiv:1302.2796 [cond-mat.stat-mech], 2013. See Table 4 p. 23.

%Y A001668 counts all self-avoiding walks on the honeycomb lattice, without the "endless" restriction.

%Y Cf. A334322 (square lattice), A334326 (simple cubic lattice), A334331 (triangular lattice), A334332 (union jack lattice), A334333 (body centered cubic lattice), A334334 (face centered cubic lattice).

%K nonn,walk

%O 0,2

%A _Michel Marcus_, Apr 23 2020

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 July 18 13:04 EDT 2024. Contains 374378 sequences. (Running on oeis4.)