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 A196811 #10 Jul 22 2025 12:51:30 %S A196811 0,0,6,144,600,1992,4592,15616,31788,74840,122210,251184,384826, %T A196811 647696,1085190,1616384,2308872,3449880,4783326,7052400,9253734, %U A196811 12454640,16453096,22180992,28552450,36216544,46089162,58449104,72061346,91140000,109813780,135448576 %N A196811 Number of ways to place 3 nonattacking nightriders on an n X n cylindrical board. %C A196811 A nightrider is a fairy chess piece that can move (proportionate to how a knight moves) in any direction. %H A196811 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a> %H A196811 Vaclav Kotesovec, <a href="/A196811/a196811.txt">Generating function and explicit formula</a> %Y A196811 Cf. A173429, A196813 %K A196811 nonn %O A196811 1,3 %A A196811 _Vaclav Kotesovec_, Oct 06 2011