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.

A353093 Solution to Forest of Numbers (Bosque de NĂºmeros) puzzle for Opaque Queens starting with numbers 1 and 2 for an n X n square grid (see Comments).

Original entry on oeis.org

3, 6, 10, 13, 16, 20, 23
Offset: 2

Views

Author

Rodolfo Kurchan, Apr 22 2022

Keywords

Comments

Start with an n X n square grid. Each cell has neighbors horizontally, vertically and diagonally. Place the numbers 1 and 2 anywhere. Now place the numbers 3, 4, ..., m in order, subject to the rule that when you place k, the sum of the numbers that a Chess Queen attack in the same row, column and diagonal must equal k. Then a(n) is the maximum m that can be achieved.

Examples

			Solution for a(5) = 13 from Daniel Valdano:
  +---+---+---+---+---+
  | 12| 4 | 8 |   |   |
  +---+---+---+---+---+
  | 7 | 1 | 3 |   | 10|
  +---+---+---+---+---+
  |   |   | 6 |   |   |
  +---+---+---+---+---+
  |   | 9 | 2 | 13| 5 |
  +---+---+---+---+---+
  |   | 11|   |   |   |
  +---+---+---+---+---+
Solution for a(6) = 16 from Daniel Valdano.
Solution for a(7) = 20 from Giorgio Vecchi.
Solution for a(8) = 23 from Giorgio Vecchi.
		

Crossrefs