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 A255436 #17 Mar 04 2024 01:40:44 %S A255436 1,1,3,4,12,26,88,257 %N A255436 Number of distinct, connected, order-n subgraphs of the infinite knight graph. %C A255436 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 A255436 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 A255436 nonn,hard,more %O A255436 2,3 %A A255436 _Tristan Miller_, Feb 23 2015