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!)
 A274948 Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= n^2) = maximal number of squares not attacked by any arrangement of k queens on an n X board = n^2 - A274947(n,k). 3
 1, 0, 4, 0, 0, 0, 0, 9, 2, 1, 0, 0, 0, 0, 0, 0, 0, 16, 6, 3, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 12, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS For further information see A274947, which is the main entry for this problem. LINKS EXAMPLE The triangle begins: 1,0, 4, 0, 0, 0, 0, 9, 2, 1, 0, 0, 0, 0, 0, 0, 0, 16, 6, 3, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 12, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ... CROSSREFS Cf. A247947, A250000. Sequence in context: A331437 A108708 A290322 * A005925 A333037 A070206 Adjacent sequences:  A274945 A274946 A274947 * A274949 A274950 A274951 KEYWORD nonn,tabf,more AUTHOR N. J. A. Sloane, Jul 27 2016 EXTENSIONS Corrections and more terms from Andrey Zabolotskiy, Jul 29 2016 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 June 6 10:35 EDT 2020. Contains 334842 sequences. (Running on oeis4.)