login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255436 Number of distinct, connected, order-n subgraphs of the infinite knight's graph. 0

%I

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

%N Number of distinct, connected, order-n 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/">Knight-graphable words</a>, Word Ways, 48:1 (2015), 2-9.

%K nonn,hard,more

%O 2,3

%A _Tristan Miller_, Feb 23 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 13:33 EST 2019. Contains 329230 sequences. (Running on oeis4.)