The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319288 a(n) is the smallest k such that A319284(n, k) >= A319284(n, j) for all 0 <= j <= n. 1
 0, 0, 1, 1, 2, 3, 4, 5, 5, 6, 7, 8, 9, 10, 11, 11, 12, 13, 14, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS 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. 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). The corresponding maxima are: 1, 1, 2, 3, 6, 14, 46, 164, 568, 2292, 9632, 44148, 222720, 1151778, 6471872, 39290462, 260303408, 1812613348, 13308584992, 102670917500. LINKS CROSSREFS Cf. A319284, A000170. Sequence in context: A256562 A228297 A303788 * A106744 A072932 A029915 Adjacent sequences:  A319285 A319286 A319287 * A319289 A319290 A319291 KEYWORD nonn,more AUTHOR Peter Luschny, Sep 16 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 25 12:01 EST 2020. Contains 332233 sequences. (Running on oeis4.)