Square array T(n,k), n >= 1, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding walks in the n X k grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.
A333509
Square array T(n,k), n >= 1, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding walks in the n X k grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.
Terms
- a(0) =1a(1) =1a(2) =8a(3) =1a(4) =16a(5) =29a(6) =1a(7) =32a(8) =95a(9) =80a(10) =1a(11) =64a(12) =313a(13) =426a(14) =195a(15) =1a(16) =128a(17) =1033a(18) =2320a(19) =1745a(20) =444a(21) =1a(22) =256a(23) =3411a(24) =12706a(25) =16347a(26) =6838a(27) =969a(28) =1a(29) =512
External references
- oeis: A333509