OFFSET
1,2
COMMENTS
Any number of colors may be used.
Equivalently, a(n) is the number of stable partitions of the n X n knight graph. A stable partition is a partition of the vertices into sets so that no two vertices in a set are adjacent in the graph.
LINKS
Eric Weisstein's World of Mathematics, Knight Graph.
Eric Weisstein's World of Mathematics, Vertex Coloring.
FORMULA
a(n) <= A000110(n^2).
EXAMPLE
a(2) = 15 = A000110(4) because the graph has no edges and so there are no restrictions on how the vertices may be colored (or equivalently the vertices partitioned into sets).
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Andrew Howroyd, Mar 13 2023
STATUS
approved