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
Links
- Guillaume Escamocher and Barry O'Sullivan, Leprechauns on the chessboard, Discrete Mathematics, 344(5), 2021.
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)
Comments