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 A337746 #15 Sep 20 2020 01:54:43 %S A337746 1,4,8,12,19,28,37,48,57,72,87 %N A337746 Maximum number of bishops within an n X n chessboard, where each bishop has a path to an edge. %C A337746 Given an n X n chessboard, this sequence is the maximum number of bishops that can be placed on the board, such that each bishop has a free path to the edge of the board without another bishop moving. %C A337746 Bishops on even and odd squares don't interfere and can be maximized separately. When n is even, the two types are equal via symmetry and thus the maximum number of bishops will be 2 * (maximum number of one type of bishop). %H A337746 Nicholas Tran, <a href="https://github.com/NicholasACTran/chess-packing">Solution in ASP</a> %Y A337746 Cf. A337722 (knights), A335445 (rooks). %K A337746 nonn,hard,more %O A337746 1,2 %A A337746 _Nicholas Tran_, Sep 17 2020