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
1, 1, 3, 4, 12, 26, 88, 257 (list; graph; refs; listen; history; text; internal format)
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: 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

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

License Agreements, Terms of Use, Privacy Policy .

Last modified March 27 20:30 EDT 2017. Contains 284177 sequences.