%I
%S 1,1,3,4,12,26,88,257
%N Number of distinct, connected, ordern subgraphs of the infinite knight's graph.
%C 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.
%H Tristan Miller and Mike Keith, <a href="http://digitalcommons.butler.edu/wordways/vol48/iss1/2/">Knightgraphable words</a>, Word Ways, 48:1 (2015), 29.
%K nonn,hard,more
%O 2,3
%A _Tristan Miller_, Feb 23 2015
