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.

Showing 1-3 of 3 results.

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

Original entry on oeis.org

3, 5, 8, 10, 13, 15, 17, 19
Offset: 2

Views

Author

Rodolfo Kurchan, Apr 21 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 in the same row, column and diagonal must equal k. Then a(n) is the maximum m that can be achieved.

Examples

			Solutions for 5 <= n <= 8 from _Pontus von Brömssen_:
  +---+---+---+---+---+
  | 1 |   | 2 | 8 |   |
  +---+---+---+---+---+
  | 9 | 3 | 5 |   |   |
  +---+---+---+---+---+
  |   |   |   |   | 6 |
  +---+---+---+---+---+
  |   |10 |   |   |   |
  +---+---+---+---+---+
  |   | 7 |   |   | 4 |
  +---+---+---+---+---+
.
  +---+---+---+---+---+---+
  | 1 | 9 |   | 8 |   |   |
  +---+---+---+---+---+---+
  |   |   |   | 7 |   |12 |
  +---+---+---+---+---+---+
  |10 |   |   |   |   |   |
  +---+---+---+---+---+---+
  |   |   | 6 |   |   | 2 |
  +---+---+---+---+---+---+
  | 5 |   |   |   |11 |   |
  +---+---+---+---+---+---+
  | 4 |   |13 |   |   | 3 |
  +---+---+---+---+---+---+
.
  +---+---+---+---+---+---+---+
  |   | 8 |   | 6 |   |   |   |
  +---+---+---+---+---+---+---+
  |   |11 | 2 |   |   |   |   |
  +---+---+---+---+---+---+---+
  |   |   |   |   | 5 |   |15 |
  +---+---+---+---+---+---+---+
  | 3 |   |   | 1 |   |   |10 |
  +---+---+---+---+---+---+---+
  |14 |   |   |   |   |   |   |
  +---+---+---+---+---+---+---+
  | 7 |   |12 |   |   |   |   |
  +---+---+---+---+---+---+---+
  | 4 |   |   |   | 9 |13 |   |
  +---+---+---+---+---+---+---+
.
  +---+---+---+---+---+---+---+---+
  | 1 | 3 |   |12 | 6 |   | 2 |   |
  +---+---+---+---+---+---+---+---+
  | 4 |   |   |   |   |   |11 |   |
  +---+---+---+---+---+---+---+---+
  |   |   | 7 |   |15 |   |   |   |
  +---+---+---+---+---+---+---+---+
  |   |   |   |   |   |   |   |14 |
  +---+---+---+---+---+---+---+---+
  |   |13 |   |   |   |   |   |   |
  +---+---+---+---+---+---+---+---+
  |10 |   |   |   |   |   | 5 |   |
  +---+---+---+---+---+---+---+---+
  |   |   |16 |   |   | 9 |   |   |
  +---+---+---+---+---+---+---+---+
  |   |   |   |   |   |17 |   | 8 |
  +---+---+---+---+---+---+---+---+
Solution for a(9) = 19 from Giorgio Vecchi

Links

Crossrefs

Cf. A352814, A350627.

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.

Links

Crossrefs

Cf. A352814, A350627, A353070.

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

Original entry on oeis.org

3, 7, 9, 12, 16, 21, 25, 32, 37
Offset: 2

Views

Author

Rodolfo Kurchan, Apr 23 2022

Keywords

Comments

Start with an n X n square grid. Each cell has neighbors horizontally and vertically. 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 Rook attack in the same row and column must equal k. Then a(n) is the maximum m that can be achieved.

Examples

			Solution for a(5) = 12 from Rodolfo Kurchan:
  +---+---+---+---+---+
  | 1 |   |   | 4 | 3 |
  +---+---+---+---+---+
  | 6 |   |   |   | 5 |
  +---+---+---+---+---+
  |   |   |   | 11| 7 |
  +---+---+---+---+---+
  |   |   |   |   | 9 |
  +---+---+---+---+---+
  | 8 | 10| 12|   | 2 |
  +---+---+---+---+---+
Solutions for a(2) to a(6) from Rodolfo Kurchan.
Solutions for a(7) to a(10) from Giorgio Vecchi.

Links

Crossrefs

Cf. A350627, A352814, A353070, A353093.
Showing 1-3 of 3 results.

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

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