login
Number of self-avoiding walks on hexagonal lattice.
(Formerly M5146)
2

%I M5146 #16 Nov 20 2017 13:58:37

%S 24,84,264,1128,4728,20304,86496,369732,1573608,6703068,28474704,

%T 120922272,512524704,2171836752,9190071984,38866395264,164191075824,

%U 693230730864

%N Number of self-avoiding walks on hexagonal lattice.

%C The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H G. Nebe and N. J. A. Sloane, <a href="http://www.math.rwth-aachen.de/~Gabriele.Nebe/LATTICES/A2.html">Home page for hexagonal (or triangular) lattice A2</a>

%H S. Redner, <a href="http://physics.bu.edu/~redner/pubs/pdf/jpa13p3525.pdf">Distribution functions in the interior of polymer chains</a>, J. Phys. A 13 (1980), 3525-3541, doi:10.1088/0305-4470/13/11/023.

%Y Cf. A007200.

%K nonn,walk

%O 3,1

%A _Simon Plouffe_

%E a(15)-a(20) from _Sean A. Irvine_, Nov 20 2017