|
|
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.
|
|
1
|
|
|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|