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 A319235 #17 Oct 09 2019 20:57:15 %S A319235 1,8,42,140,344,568,550,312,92 %N A319235 The profile of the backtrack tree for the eight queens problem. %C A319235 The profile (p_0, p_1, ..., p_n) is the number of nodes at each level of the tree. %C A319235 The backtrack tree as defined by Knuth has for the eight queens problem 2057 nodes. %D A319235 D. E. Knuth, The Art of Computer Programming, Volume 4, Pre-fascicle 5B, Introduction to Backtracking, 7.2.2. Backtrack programming. 2018. %H A319235 Wikipedia, <a href="https://en.wikipedia.org/wiki/Backtracking">Backtracking</a> %H A319235 Wikipedia, <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle">Eight queens puzzle</a> %F A319235 a(8) = A000170(8), the number of solutions. %Y A319235 Cf. A000170, A319236. %K A319235 nonn,fini,full %O A319235 0,2 %A A319235 _Peter Luschny_, Sep 15 2018