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 A301860 #9 Jun 03 2018 16:49:50 %S A301860 10,12,12,14,16 %N A301860 Number of steps required in the worst case for n knights to find the princess in a castle with rooms arranged in a (n+1) X (n+1) grid (Castle and princess puzzle). %C A301860 The main entry for this problem is A300576. In this version there are n knights who are searching for the princess inside a grid; each knight can search a different room. %C A301860 It is not possible to solve the n X n grid with fewer than (n-1) knights. %C A301860 a(2) and a(3) were found by Robby Goetschalckx. %H A301860 Dmitry Kamenetsky, <a href="/A301860/a301860.txt">Optimal solutions</a> %Y A301860 Cf. A300576. %K A301860 nonn,more %O A301860 2,1 %A A301860 _Dmitry Kamenetsky_, Mar 28 2018