Triangle read by rows: T(n,k) is the number of self-avoiding paths of length n-1+2*k from NW to SW corners in the n X n grid graph (0 <= k <= A000217(n-1), n >= 1).
A329633
Triangle read by rows: T(n,k) is the number of self-avoiding paths of length n-1+2*k from NW to SW corners in the n X n grid graph (0 <= k <= A000217(n-1), n >= 1).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =5a(6) =2a(7) =1a(8) =6a(9) =16a(10) =39a(11) =61a(12) =47a(13) =8a(14) =1a(15) =10a(16) =40a(17) =125a(18) =400a(19) =1048a(20) =1905a(21) =2372a(22) =1839a(23) =764a(24) =86a(25) =1a(26) =15a(27) =85a(28) =335a(29) =1237
External references
- oeis: A329633