

A255436


Number of distinct, connected, ordern subgraphs of the infinite knight's graph.


0




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, Knightgraphable words, Word Ways, 48:1 (2015), 29.


CROSSREFS

Sequence in context: A111758 A264484 A000942 * A197459 A000207 A002986
Adjacent sequences: A255433 A255434 A255435 * A255437 A255438 A255439


KEYWORD

nonn,hard,more


AUTHOR

Tristan Miller, Feb 23 2015


STATUS

approved



