Number of non-congruent simple polygons with 2n sides on the unbounded chessboard such that each side is an edge of the corresponding knight graph.
A368499
Number of non-congruent simple polygons with 2n sides on the unbounded chessboard such that each side is an edge of the corresponding knight graph.
Terms
- a(0) =3a(1) =13a(2) =178a(3) =3034a(4) =64877a(5) =1503790a(6) =36930111
External references
- oeis: A368499