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 A366476 #19 Oct 14 2024 22:26:29 %S A366476 1,25,625 %N A366476 Number of possible chmess games at the end of the n-th ply. %C A366476 Chmess is an imaginary game very similar to chess, with the exception that the king can move two squares in any direction instead of just one. To get a(1) = 25 I am assuming the king can jump over an occupied square, but is not allowed to move out and back (which would give a(1) = 26). %D A366476 Daniel C. Dennett, Higher-order truths about chmess, Topoi 25 (1-2):39-41 (2006). %D A366476 Nigel Warburton, Review of "I've Been Thinking" by Daniel C. Dennett (Allen Lane, 2023), TLS #6290 (Oct 20, 2023), pp. 8-9. %H A366476 Daniel C. Dennett, <a href="https://philpapers.org/rec/DENHTA">Higher-order truths about chmess</a>, Topoi 25 (1-2):39-41 (2006). %H A366476 N. J. A. Sloane and others, <a href="https://groups.google.com/g/seqfan/c/oBXzRwIdmFA">Anyone for Chmess?</a>, Conversation in the SeqFan Google Group, Oct 14 2024. %Y A366476 Cf. A006494, A048987. %K A366476 nonn,more,bref %O A366476 0,2 %A A366476 _N. J. A. Sloane_, Oct 26 2023