|
%I #27 Jun 03 2022 01:43:41
%S 1,0,0,6,12,120,564,4074,25008,174618,1181100,8358306,59167872,
%T 427081512,3103408308,22797207330,168616517760,1256350493196
%N Number of self-avoiding walks on a tetrahedral (diamond) net, having 2n steps and forming a closed loop.
%H Anthony J. Guttmann and Iwan Jensen, <a href="https://doi.org/10.1007/978-1-4020-9927-4_16">Appendix: Series Data and Growth Constant, Amplitude and Exponent Estimates</a>, in: Polygons, Polyominoes and Polycubes, LNP 775, Springer, 2009. See Table 16.12 on p. 480 for the sequence a(n)/n.
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a038/A038515.java">Java program</a> (github)
%Y Cf. A001394, A001667, A001413, A001337, A344070, A344071.
%K nonn,walk,more
%O 0,4
%A _Wouter Meeussen_
%E a(0)=1 and a(9)-a(15) from _Sean A. Irvine_, Jan 16 2021
%E a(16)-a(17) using the data from Guttmann & Jensen added by _Andrey Zabolotskiy_, Jun 02 2022
|
