|
|
A153125
|
|
Triangle read by rows: T(n,k) = maximal number of squares that can be covered by a queen on an n X k chessboard, 1<=k<=n.
|
|
3
|
|
|
1, 2, 4, 3, 6, 9, 4, 7, 10, 12, 5, 8, 11, 14, 17, 6, 9, 12, 15, 18, 20, 7, 10, 13, 16, 19, 22, 25, 8, 11, 14, 17, 20, 23, 26, 28, 9, 12, 15, 18, 21, 24, 27, 30, 33, 10, 13, 16, 19, 22, 25, 28, 31, 34, 36, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 12, 15, 18, 21, 24, 27, 30, 33, 36
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
T(n,2*k-1) = T(n-1,2*k-1) + 1 for 2*k-1<n.
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = n + 3*(k-1) - (1 - n Mod 2)*delta_{n,k}, 1<=k<=n; delta is the Kronecker symbol.
|
|
EXAMPLE
|
Triangle T(n,k) begins:
1;
2, 4;
3, 6, 9;
4, 7, 10, 12;
5, 8, 11, 14, 17;
6, 9, 12, 15, 18, 20;
7, 10, 13, 16, 19, 22, 25;
8, 11, 14, 17, 20, 23, 26, 28;
|
|
MATHEMATICA
|
T[n_, k_]:=n+3*(k-1)-(1-Mod[n, 2])*If[k==n, 1, 0];
Flatten[Table[Table[T[n, k], {k, 1, n}], {n, 1, 20}]]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|