cp's OEIS Frontend

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.

A352623 a(n) is the maximum number k of queens that can be placed on an n X n chessboard such that, for each number j in 0..k-1, there is a queen attacking exactly j unoccupied squares.

Table of values

n a(n)
0 0
1 1
2 0
3 5
4 8
5 11
6 14
7 18
8 22

List of values

[0, 1, 0, 5, 8, 11, 14, 18, 22]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.