a(n) is the number of bilaterally symmetrical self-avoiding paths connecting consecutive corners of an n X n triangular grid.
A343310
a(n) is the number of bilaterally symmetrical self-avoiding paths connecting consecutive corners of an n X n triangular grid.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =12a(4) =50a(5) =264a(6) =2054a(7) =22324a(8) =377704a(9) =9455172a(10) =385118374a(11) =23504746636
External references
- oeis: A343310