A255436 Number of distinct, connected, order-n subgraphs of the infinite knight graph.

1, 1, 3, 4, 12, 26, 88, 257

Offset: 2

Author

Tristan Miller, Feb 23 2015

Keywords

• nonn
• hard
• more

Comments

More concretely, a(n) is the number of distinct graphs where the vertices can be mapped to different squares of a chessboard such that the connected pairs of vertices are a knight's move apart.

Links

• Tristan Miller and Mike Keith, Knight-graphable words, Word Ways, 48:1 (2015), 2-9.