The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227716 Triangle read by rows: Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 2k+1. 7

%I

%S 2,10,8,74,56,32,518,464,288,128,3934,3520,2656,1408,512,29914,27768,

%T 21920,14336,6656,2048,232094,217316,181456,128256,74240,30720,8192,

%U 1812890,1719616,1475172,1118592,716288,372736,139264,32768,14277886,13633972,11989800,9480048

%N Triangle read by rows: Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 2k+1.

%C The number of walks ending with x = -k is the same as the number ending with x = k.

%H Bert Dobbelaere, <a href="/A227716/b227716.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 1, 3, 5, ...):

%e { 2 };

%e { 10, 8 };

%e { 74, 56, 32 };

%e { 518, 464, 288, 128 }.

%Y Cf. A001394, A001395, A001396, A001397, A001398, A227715.

%K nonn,walk,tabl

%O 0,1

%A _Joseph Myers_, Jul 21 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 2 02:53 EDT 2021. Contains 346409 sequences. (Running on oeis4.)