Number of self-avoiding closed paths in the 4 X n grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.
A333760
Number of self-avoiding closed paths in the 4 X n grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.
Terms
- a(0) =1a(1) =3a(2) =11a(3) =36a(4) =122a(5) =408a(6) =1371a(7) =4599a(8) =15437a(9) =51804a(10) =173860a(11) =583476a(12) =1958173a(13) =6571695a(14) =22054863a(15) =74016936a(16) =248403622a(17) =833651844a(18) =2797766831a(19) =9389410251a(20) =31511212505a(21) =105752809368a(22) =354910389192
External references
- oeis: A333760