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 A196813 #9 Jul 22 2025 12:51:43 %S A196813 0,0,6,96,600,1392,2156,10624,22410,62400,82280,210336,280540,495488, %T A196813 955950,1332736,1844976,2924640,3933456,6319200,7954170,10648000, %U A196813 14081980,19826304,25502500,31809856,41037354,52338272,63979916,84001200,98348740,123033600 %N A196813 Number of ways to place 3 nonattacking nightriders on an n X n toroidal board. %C A196813 A nightrider is a fairy chess piece that can move (proportionate to how a knight moves) in any direction. %H A196813 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 4th edition p.195 %H A196813 Vaclav Kotesovec, <a href="/A196813/a196813.txt">Generating function and explicit formula</a> %Y A196813 Cf. A173429, A196811 %K A196813 nonn %O A196813 1,3 %A A196813 _Vaclav Kotesovec_, Oct 06 2011