This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A278215 Triangle read by rows: T(n, k) with 0 <= k <= n^2 is the maximum number of moves that can be made by k non-attacking rooks on an n X n board. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Table begins: 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 LINKS 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 CROSSREFS Cf. A278211, A278213, A278214. Sequence in context: A278887 A011168 A058672 * A317896 A320364 A318222 Adjacent sequences:  A278212 A278213 A278214 * A278216 A278217 A278218 KEYWORD nonn,tabf,more AUTHOR Peter Kagey, Nov 16 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 15 22:25 EDT 2019. Contains 328038 sequences. (Running on oeis4.)