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.

A320574 a(n) gives the number of configurations of non-attacking rooks up to symmetry on an n X n chessboard such that the number of distinct distances between the rooks is given by A320448(n).

Original entry on oeis.org

1, 1, 2, 1, 1, 3, 6, 4, 4, 2, 6, 3, 18, 9
Offset: 1

Views

Author

Peter Kagey, Oct 15 2018

Keywords

Comments

Conjecture: a(n) = A320573(n)/8 for all n > 3.

Examples

			For n = 6 the a(6) = 3 configurations with A320448(6) = 11 distinct distances are:
+---+---+---+---+---+---+
| * |   |   |   |   |   |
+---+---+---+---+---+---+
|   |   | * |   |   |   |
+---+---+---+---+---+---+
|   | * |   |   |   |   |
+---+---+---+---+---+---+,
|   |   |   |   | * |   |
+---+---+---+---+---+---+
|   |   |   |   |   | * |
+---+---+---+---+---+---+
|   |   |   | * |   |   |
+---+---+---+---+---+---+
+---+---+---+---+---+---+
| * |   |   |   |   |   |
+---+---+---+---+---+---+
|   |   | * |   |   |   |
+---+---+---+---+---+---+
|   |   |   |   |   | * |
+---+---+---+---+---+---+, and
|   |   |   | * |   |   |
+---+---+---+---+---+---+
|   |   |   |   | * |   |
+---+---+---+---+---+---+
|   | * |   |   |   |   |
+---+---+---+---+---+---+
+---+---+---+---+---+---+
| * |   |   |   |   |   |
+---+---+---+---+---+---+
|   | * |   |   |   |   |
+---+---+---+---+---+---+
|   |   |   |   | * |   |
+---+---+---+---+---+---+.
|   |   |   | * |   |   |
+---+---+---+---+---+---+
|   |   |   |   |   | * |
+---+---+---+---+---+---+
|   |   | * |   |   |   |
+---+---+---+---+---+---+
		

Crossrefs

Extensions

a(10)-a(14) from Giovanni Resta, Oct 21 2018