OFFSET
0,3
COMMENTS
We construct the lexicographically earliest sequence of points M(i), for i >= 0, with the following rules:
- their (x, y) coordinates are taken among the nonnegative integers;
- if i > 0 and i is odd, then "move horizontally to a free column"; i.e., M(i) must have the same y as M(i-1), and M(i) is not allowed to have the same x as any M(k) for k < i;
- if i > 0 and i is even, then "move vertically to a free row"; i.e., M(i) must have the same x as M(i-1), and M(i) is not allowed to have the same y as any M(k) for k < i;
- three points are not allowed to be aligned.
See SVG illustration, Links section.
Then a(n) (resp. A362978(n)) is defined as the x-coordinate (resp. y-coordinate) of M(i), where i := 2n (to eliminate duplicates).
LINKS
EXAMPLE
y
^
| . . . 9 . . 8
| . . 4 . . 5 .
| . . . . . 6 7
| . 2 3 . . . .
| 0 1 . . . . .
+-------------------> x
0 1 2 3 4 5 6
Abscissas of the points 0, 2, 4, 6, 8, ...: 0, 1, 2, 5, 6, ...
PROG
(Java) see link.
CROSSREFS
KEYWORD
nonn
AUTHOR
Luc Rousseau, May 11 2023
STATUS
approved