A038515 Number of self-avoiding walks on a tetrahedral (diamond) net, having 2n steps and forming a closed loop.

1, 0, 0, 6, 12, 120, 564, 4074, 25008, 174618, 1181100, 8358306, 59167872, 427081512, 3103408308, 22797207330, 168616517760, 1256350493196

Offset

0,4

Links

Table of n, a(n) for n=0..17.

Anthony J. Guttmann and Iwan Jensen, Appendix: Series Data and Growth Constant, Amplitude and Exponent Estimates, in: Polygons, Polyominoes and Polycubes, LNP 775, Springer, 2009. See Table 16.12 on p. 480 for the sequence a(n)/n.

Sean A. Irvine, Java program (github)

Crossrefs

Cf. A001394, A001667, A001413, A001337, A344070, A344071.

Sequence in context: A207838 A191662 A095388 * A335735 A051586 A228858

Adjacent sequences: A038512 A038513 A038514 * A038516 A038517 A038518

Keyword

nonn,walk,more

Author

Wouter Meeussen

Extensions

a(0)=1 and a(9)-a(15) from Sean A. Irvine, Jan 16 2021

a(16)-a(17) using the data from Guttmann & Jensen added by Andrey Zabolotskiy, Jun 02 2022

Status

approved