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 A319288 #9 Sep 18 2018 02:41:25 %S A319288 0,0,1,1,2,3,4,5,5,6,7,8,9,10,11,11,12,13,14,15 %N A319288 a(n) is the smallest k such that A319284(n, k) >= A319284(n, j) for all 0 <= j <= n. %C A319288 Intuitively this is the level in the backtrack tree of the n queens problem where the algorithm spends more time than on any other level. %C A319288 The constraint 'is the smallest' in the name can be dropped if the profile of the backtrack tree of the n queens problem is unimodal (for n>1). %C A319288 The corresponding maxima are: 1, 1, 2, 3, 6, 14, 46, 164, 568, 2292, 9632, 44148, 222720, 1151778, 6471872, 39290462, 260303408, 1812613348, 13308584992, 102670917500. %Y A319288 Cf. A319284, A000170. %K A319288 nonn,more %O A319288 0,5 %A A319288 _Peter Luschny_, Sep 16 2018