STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A326757
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
a(n) is the X-coordinate of the n-th nonattacking queen placed by a greedy algorithm on N^3 (see Comments for details).
(history; published version)
(history; published version)
STATUS
proposed
reviewed
STATUS
editing
proposed
LINKS
Rémy Sigrist, <a href="https://A326757practical-ardinghelli-959d8f.netlify.app/a326757.html">Interactive scatterplot of the first 25000 queens</a>
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
EXAMPLE
The first queen is placed at position (0, 0, 0) and attacks every position (m*i, m*j, m*k) with max(abs(i), abs(, j), abs(, k)) = 1 and m > 0.
EXAMPLE
The first queen is placed at position (0, 0, 0) and attacks every position (m*i, m*j, m*k) with max(abs(i), abs(j), abs(k)) = 1 and m > 0.
It attacks every position (m*i, m*j, m*k) with max(abs(i), abs(j), abs(k)) = 1 and m > 0.
COMMENTS
This sequence is a 3-dimensional variant of A275901.
EXAMPLE
The traversal of N^3 starts:
X Y Z
- - -
0 0 0
0 0 1
0 1 0
1 0 0
0 0 2
0 1 1
1 0 1
0 2 0
1 1 0
2 0 0
0 0 3
0 1 2
1 0 2
...
The first queen is placed at position (0, 0, 0).
It attacks every position (m*i, m*j, m*k) with max(abs(i), abs(j), abs(k)) = 1 and m > 0.
The second queen is placed at position (0, 1, 2).
LINKS
Rémy Sigrist, <a href="/A326757/b326757.txt">Table of n, a(n) for n = 0..10000</a>
STATUS
approved
editing