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-1 of 1 results.

A343907 a(n) is the least s > 1 for which it is possible to place s nonattacking range-n leprechauns on an s X s board.

Original entry on oeis.org

4, 10, 16, 28, 36, 52, 64, 82, 100
Offset: 1

Views

Author

Guillaume Escamocher, May 03 2021

Keywords

Comments

A range-n leprechaun is a fairy chess piece that can move to any square within range n, and to any square that a queen can move to. A range-1 leprechaun is a queen and a range-2 leprechaun is a superqueen. (Escamocher and O'Sullivan 2021)

Links

Crossrefs

Cf. A343905.

Formula

If n is odd, a(n) = (n+1)^2. If n is even, a(n) > (n+1)^2. (Escamocher and O'Sullivan 2021)
Showing 1-1 of 1 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.