login
A278215
Triangle read by rows: T(n, k) with 0 <= k <= n^2 is the maximum number of possible moves that can be made by k rooks of the same color on an n X n board.
3
0, 0, 0, 2, 4, 2, 0, 0, 4, 8, 12, 12, 12, 9, 6, 4, 0, 0, 6, 12, 18, 24, 26, 28, 26, 24, 22, 20, 18, 16, 12, 8, 4, 0, 0, 8, 16, 24, 32, 40, 44, 48, 48, 48, 46, 44, 44, 42, 40, 38, 36, 32, 28, 24, 20, 16, 12, 8, 4, 0
OFFSET
1,4
LINKS
Christian Sievers, Table of n, a(n) for n = 1..1512 (board size up to 16 X 16)
EXAMPLE
T(4, 5) = 26 with the following 5 rooks on a 4 X 4 board:
+---+---+---+---+
4| | | | R |
+---+---+---+---+
3| | | R | |
+---+---+---+---+
2| | R | | |
+---+---+---+---+
1| R | | | R |
+---+---+---+---+
A B C D
Table begins:
n\k| 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
---+-------------------------------------------------
1| 0 0
2| 0 2 4 2 0
3| 0 4 8 12 12 12 9 6 4 0
4| 0 6 12 18 24 26 28 26 24 22 20 18 16 12 8 4 0
PROG
(Python) # (using PuLP library) see links section of A278214
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Peter Kagey, Nov 16 2016
EXTENSIONS
Definition corrected by Christian Sievers, Jun 11 2023
STATUS
approved