cp's OEIS Frontend

A187167 Number of 6-step self-avoiding walks on an n X n X n cube summed over all starting positions.

%I A187167 #14 Apr 20 2018 14:39:02
%S A187167 0,240,9504,51504,148224,320328,588924,975216,1500408,2185704,3052308,
%T A187167 4121424,5414256,6952008,8755884,10847088,13246824,15976296,19056708,
%U A187167 22509264,26355168,30615624,35311836,40465008,46096344,52227048,58878324
%N A187167 Number of 6-step self-avoiding walks on an n X n X n cube summed over all starting positions.
%H A187167 R. H. Hardin, <a href="/A187167/b187167.txt">Table of n, a(n) for n = 1..50</a>
%F A187167 Empirical: a(n) = 3534*n^3 - 15366*n^2 + 19536*n - 7056 for n>4.
%F A187167 Conjectures from _Colin Barker_, Apr 20 2018: (Start)
%F A187167 G.f.: 12*x^2*(20 + 712*x + 1244*x^2 - 144*x^3 - 110*x^4 + 37*x^5 + 8*x^6) / (1 - x)^4.
%F A187167 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>8.
%F A187167 (End)
%e A187167 A solution for 2 X 2 X 2:
%e A187167 ..0..6.....0..1
%e A187167 ..4..5.....3..2
%Y A187167 Row 6 of A187162.
%K A187167 nonn,walk
%O A187167 1,2
%A A187167 _R. H. Hardin_, Mar 06 2011