T(n,k) = Number of n-step self-avoiding walks on a k X k X k cube summed over all starting positions.

A187162

T(n,k) = Number of n-step self-avoiding walks on a k X k X k cube summed over all starting positions.

Terms

    a(0) =1a(1) =8a(2) =0a(3) =27a(4) =24a(5) =0a(6) =64a(7) =108a(8) =48a(9) =0a(10) =125a(11) =288a(12) =342a(13) =96a(14) =0a(15) =216a(16) =600a(17) =1056a(18) =1104a(19) =144a(20) =0a(21) =343a(22) =1080a(23) =2370a(24) =3984a(25) =3240a(26) =240a(27) =0a(28) =512a(29) =1764

External references