|
%I #13 Jan 12 2019 11:12:39
%S 1,4,4,28,24,16,188,188,128,64,1428,1368,1120,640,256,10708,10572,
%T 8864,6208,3072,1024,82948,81376,71572,53376,32768,14336,4096,644788,
%U 637148,570512,453424,304640,166912,65536,16384,5067404,5007560,4572076,3762672,2728256,1669120
%N Triangle read by rows: Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 2k.
%C The number of walks ending with x = -k is the same as the number ending with x = k.
%H Bert Dobbelaere, <a href="/A227715/b227715.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, 2, 4, ...):
%e { 1 };
%e { 4, 4 };
%e { 28, 24, 16 };
%e { 188, 188, 128, 64 }.
%Y Cf. A001394, A001395, A001396, A001397, A001398, A227716.
%K nonn,walk,tabl
%O 0,2
%A _Joseph Myers_, Jul 21 2013
|
