This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A361453 #18 Feb 16 2025 08:34:05 %S A361453 1,15,4141,450288795,50602429743064097,12123635532529660182357354372 %N A361453 Number of colorings of the n X n knight graph up to permutation of the colors. %C A361453 Any number of colors may be used. %C A361453 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. %H A361453 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>. %H A361453 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/VertexColoring.html">Vertex Coloring</a>. %F A361453 a(n) <= A000110(n^2). %e A361453 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). %Y A361453 Main diagonal of A208001. %Y A361453 Cf. A000110, A207863 (grid graph), A289136 (king), A295178. %K A361453 nonn,more %O A361453 1,2 %A A361453 _Andrew Howroyd_, Mar 13 2023