Number of self-avoiding walks in the n X 3 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.
A333511
Number of self-avoiding walks in the n X 3 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) =16a(2) =95a(3) =426a(4) =1745a(5) =6838a(6) =25897a(7) =95292a(8) =342505a(9) =1208392a(10) =4201765a(11) =14445130a(12) =49221691a(13) =166563454a(14) =560595853a(15) =1878809676a(16) =6275993883a(17) =20910561068a(18) =69531299103a(19) =230845071646a(20) =765487674235
External references
- oeis: A333511