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.

4, 10, 16, 28, 36, 52, 64, 82, 100

Offset

1,1

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

Table of n, a(n) for n=1..9.

Guillaume Escamocher and Barry O'Sullivan, Leprechauns on the chessboard, Discrete Mathematics, 344(5), 2021.

Formula

If n is odd, a(n) = (n+1)^2. If n is even, a(n) > (n+1)^2. (Escamocher and O'Sullivan 2021)

Crossrefs

Cf. A343905.

Sequence in context: A132227 A036063 A112984 * A191115 A073121 A167346

Adjacent sequences: A343904 A343905 A343906 * A343908 A343909 A343910

Keyword

nonn,more

Author

Guillaume Escamocher, May 03 2021

Status

approved