A337108 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A337108

Square spiral constructed by greedy algorithm, so that each diagonal and antidiagonal contains distinct numbers.

0, 0, 1, 1, 1, 0, 2, 1, 2, 2, 0, 2, 3, 3, 2, 3, 3, 2, 0, 2, 4, 3, 1, 3, 4, 4, 3, 0, 4, 4, 5, 5, 5, 1, 4, 5, 5, 4, 5, 0, 3, 4, 6, 5, 5, 1, 6, 5, 6, 6, 5, 6, 0, 6, 3, 6, 7, 7, 4, 7, 1, 7, 6, 7, 7, 6, 3, 6, 0, 6, 7, 6, 8, 7, 8, 7, 1, 7, 4, 7, 8, 8, 7, 4, 2, 0, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,7

COMMENTS

This sequence is a variant of A308896; here we walk a bishop, there a rook.

Visually, we have a superposition of two images that we can separate by considering the parity of the x and y coordinates (see illustrations in Links section).

LINKS

Rémy Sigrist, Table of n, a(n) for n = 0..10200

Rémy Sigrist, Colored representation of the spiral for -512 <= x, y <= 512

Rémy Sigrist, Colored representation of the spiral for -512 <= x, y <= 512 and x any y have the same parity

Rémy Sigrist, Colored representation of the spiral for -512 <= x, y <= 512 and x and y have different parity

Rémy Sigrist, PARI program for A337108

FORMULA

a(n) = 0 iff n belongs to A035608.

EXAMPLE

The spiral begins:

7----7----6----7----1----7----4----7----7

| |