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

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

Offset

2,3

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

Table of n, a(n) for n=2..9.

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

Crossrefs

Sequence in context: A264484 A343163 A000942 * A197459 A330659 A000207

Adjacent sequences: A255433 A255434 A255435 * A255437 A255438 A255439

Keyword

nonn,hard,more

Author

Tristan Miller, Feb 23 2015

Status

approved