Number of self-avoiding walks in the n X 2 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.

A333510

Number of self-avoiding walks in the n X 2 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) =8a(2) =29a(3) =80a(4) =195a(5) =444a(6) =969a(7) =2056a(8) =4279a(9) =8788a(10) =17885a(11) =36176a(12) =72875a(13) =146412a(14) =293649a(15) =588312a(16) =1177855a(17) =2357188a(18) =4716133a(19) =9434336a(20) =18871091a(21) =37744988a(22) =75493209a(23) =150990120a(24) =301984455a(25) =603973684a(26) =1207952749a(27) =2415911536a(28) =4831829819a(29) =9663667148

External references