|
%I #4 Mar 31 2012 12:36:09
%S 1,2,0,3,2,0,4,4,0,0,5,6,2,0,0,6,8,4,0,0,0,7,10,6,2,0,0,0,8,12,8,4,0,
%T 0,0,0,9,14,10,6,2,0,0,0,0,10,16,12,8,4,0,0,0,0,0,11,18,14,10,6,2,0,0,
%U 0,0,0,12,20,16,12,8,4,0,0,0,0,0,0,13,22,18,14,10,6,2,0,0,0,0,0,0,14,24,20,16
%N T(n,k)=Number of n-step self-avoiding walks on a k-long line summed over all starting positions
%C Table starts
%C .1.2.3.4.5..6..7..8..9.10.11.12.13.14
%C .0.2.4.6.8.10.12.14.16.18.20.22.24
%C .0.0.2.4.6..8.10.12.14.16.18.20
%C .0.0.0.2.4..6..8.10.12.14.16
%C .0.0.0.0.2..4..6..8.10.12
%C .0.0.0.0.0..2..4..6..8
%C .0.0.0.0.0..0..2..4
%C .0.0.0.0.0..0..0
%C .0.0.0.0.0..0
%C .0.0.0.0.0
%F Empirical: T(1,k) = k
%F Empirical: T(2,k) = 2*k - 2
%F Empirical: T(3,k) = 2*k - 4 for k>1
%F Empirical: T(4,k) = 2*k - 6 for k>2
%F Empirical: T(5,k) = 2*k - 8 for k>3
%F Empirical: T(6,k) = 2*k - 10 for k>4
%F Empirical: T(7,k) = 2*k - 12 for k>5
%F Empirical: T(8,k) = 2*k - 14 for k>6
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Mar 12 2011
|
