On a (2n+1) X (2n+1) board, let m(i) be the number of squares that are i knight's moves from center; sequence gives max m(i) for i >= 0.
A038522
On a (2n+1) X (2n+1) board, let m(i) be the number of squares that are i knight's moves from center; sequence gives max m(i) for i >= 0.
Terms
- a(0) =1a(1) =1a(2) =8a(3) =20a(4) =32a(5) =52a(6) =68a(7) =76a(8) =96a(9) =96a(10) =120a(11) =120a(12) =148a(13) =148a(14) =176a(15) =176a(16) =204a(17) =204a(18) =232a(19) =232a(20) =260a(21) =260a(22) =288a(23) =288a(24) =316a(25) =316a(26) =344a(27) =344a(28) =372a(29) =372
External references
- oeis: A038522