OFFSET
1,2
COMMENTS
We consider an infinite chessboard on the subset S of points X = (x_k)_{k>=0} of N^N such that Sum_{k>=0} x_k is finite:
- any point X = (x_k)_{k>=0} of S is uniquely identified by the positive number f(X) = Product_{k>=0} prime(k+1)^x_k (where prime(k) denotes the k-th prime number),
- two distinct points X = {x_k}_{k>=0} and Y = {y_k}_{k>=0} are aligned iff { x_k - y_k, k >= 0 } = { 0, m } for some m > 0.
We traverse S by increasing value of f, and place nonattacking queens as soon as possible; a(n) is the value of f applied to the position of the n-th queen.
LINKS
Rémy Sigrist, PARI program for A309817
EXAMPLE
We first visit the origin and place our first queen on it.
Hence a(1) = Product_{k>=0} prime(k+1)^0 = 1.
This first queen attacks every point X such that f(X) is in A072774.
The second queen is placed at position (2, 1, 0, 0, 0...}; a(2) = 2^2 * 3 = 12.
PROG
(PARI) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Aug 18 2019
STATUS
approved