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 A319236 #22 Oct 09 2019 20:57:21 %S A319236 1,16,210,2236,19688,141812,838816,3998456,15324708,46358876, %T A319236 108478966,193892860,260303408,253897632,171158018,72002088,14772512 %N A319236 The profile of the backtrack tree for the sixteen queens problem. %C A319236 The profile (p_0, p_1, ..., p_n) is the number of nodes at each level of the tree. %C A319236 The backtrack tree as defined by Knuth has for the sixteen queens problem 1141190303 nodes. %D A319236 D. E. Knuth, The Art of Computer Programming, Volume 4, Pre-fascicle 5B, Introduction to Backtracking, 7.2.2. Backtrack programming. 2018. %H A319236 Wikipedia, <a href="https://en.wikipedia.org/wiki/Backtracking">Backtracking</a> %H A319236 Wikipedia, <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle">Eight queens puzzle</a> %F A319236 a(16) = A000170(16), the number of solutions. %Y A319236 Cf. A000170, A319235. %K A319236 nonn,fini,full %O A319236 0,2 %A A319236 _Peter Luschny_, Sep 15 2018