cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A320448 a(n) is the maximum number of distinct distances between n non-attacking rooks on an n X n chessboard.

Original entry on oeis.org

0, 1, 2, 4, 8, 11, 15, 20, 25, 31, 37, 44, 51, 59, 68
Offset: 1

Views

Author

Peter Kagey, Oct 12 2018

Keywords

Comments

A319476(n) <= a(n) <= n(n-1)/2.

Examples

			For n = 5 a placement of five rooks on a 5 X 5 board with a(5) = 8 distinct distances is:
  +---+---+---+---+---+
5 |   | * |   |   |   |
  +---+---+---+---+---+
4 | * |   |   |   |   |
  +---+---+---+---+---+
3 |   |   |   |   | * |
  +---+---+---+---+---+.
2 |   |   | * |   |   |
  +---+---+---+---+---+
1 |   |   |   | * |   |
  +---+---+---+---+---+
    A   B   C   D   E
The distances between pairs of pieces are:
1)   sqrt(2)  (A4 to B5 and C2 to D1)
2) 2*sqrt(2)  (A4 to C2)
3) 3*sqrt(2)  (A4 to D1)
4)   sqrt(17) (A4 to E3)
5)   sqrt(10) (B5 to C2)
6) 2*sqrt(5)  (B5 to D1)
7)   sqrt(13) (B5 to E3)
8)   sqrt(5)  (C2 to E3 and D1 to E3)
		

Crossrefs

Extensions

a(11)-a(14) from Giovanni Resta, Oct 17 2018
a(15) from Bert Dobbelaere, Jan 01 2019