

A278213


Triangle read by rows: T(n, k) with 0 <= k <= n^2 is the maximum number of moves that can be made by k nonattacking bishops on an n X n board.


3



0, 0, 0, 1, 2, 1, 0, 0, 4, 6, 8, 8, 8, 8, 6, 4, 0, 0, 5, 10, 13, 16, 17, 18, 19, 20, 19, 18, 17, 16, 12, 8, 4, 0, 0, 8, 14, 20, 24, 28, 30, 32, 34, 35, 36, 38, 38, 38, 37, 36, 36, 32, 28, 24, 20, 16, 12, 8, 4, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


COMMENTS

Table begins:
0, 0
0, 1, 2, 1, 0
0, 4, 6, 8, 8, 8, 8, 6, 4, 0
0, 5, 10, 13, 16, 17, 18, 19, 20, 19, 18, 17, 16, 12, 8, 4, 0


LINKS

Table of n, a(n) for n=1..60.


EXAMPLE

T(4, 3) = 13 with the following 3 bishops on a 4x4 board:
+++++
4   B  
+++++
3   B  
+++++
2   B  
+++++
1    
+++++
A B C D
The bishop at C4 has three legal moves and the bishops at C3 and C2 have five legal moves each.


CROSSREFS

Cf. A278212.
Sequence in context: A274776 A274777 A136129 * A034093 A246187 A079508
Adjacent sequences: A278210 A278211 A278212 * A278214 A278215 A278216


KEYWORD

nonn,more,tabf


AUTHOR

Peter Kagey, Nov 16 2016


STATUS

approved



