|
%I #15 Jan 14 2019 03:09:13
%S 1,4,4,36,32,16,308,292,192,64,2764,2672,2016,1024,256,25404,24780,
%T 20160,12480,5120,1024,237164,232512,197940,137472,71680,24576,4096,
%U 2237948,2201948,1930944,1443616,869376,390144,114688,16384,21286548,20997008,18805488,14786176
%N Triangle read by rows: Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = k.
%C The number of walks ending with x = -k is the same as the number ending with x = k.
%H Bert Dobbelaere, <a href="/A227511/b227511.txt">Table of n, a(n) for n = 0..135</a> (terms 0..77 from Joseph Myers)
%H J. L. Martin, <a href="http://dx.doi.org/10.1017/S0305004100036240">The exact enumeration of self-avoiding walks on a lattice</a>, Proc. Camb. Phil. Soc., 58 (1962), 92-101.
%e Initial rows (paths of length 0, 1, 2, ...):
%e { 1 };
%e { 4, 4 };
%e { 36, 32, 16 };
%e { 308, 292, 192, 64 }.
%Y Cf. A000765, A000766, A000767, A000768, A001336.
%K nonn,walk,tabl
%O 0,2
%A _Joseph Myers_, Jul 14 2013
|
