|
|
A275103
|
|
Hilbert curve constructed by greedy algorithm, such that each element is the smallest positive integer possible and that all rows, columns, and diagonals contain distinct numbers.
|
|
3
|
|
|
1, 2, 3, 4, 2, 3, 1, 5, 4, 2, 5, 1, 2, 6, 5, 4, 3, 5, 1, 6, 7, 8, 9, 10, 6, 3, 4, 8, 7, 9, 8, 11, 2, 1, 8, 4, 1, 6, 10, 3, 9, 5, 7, 11, 3, 10, 6, 4, 9, 10, 1, 7, 11, 3, 9, 12, 4, 8, 5, 7, 11, 13, 12, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The n-th cell has x-coordinates given by A059252 and y-coordinates given by A059253.
This idea is similar to A269526 and A274640, but for a different curve.
|
|
LINKS
|
|
|
EXAMPLE
|
The Hilbert curve begins:
1, 4, 2, 3, ...
2, 3, 5, 1, ...
5, 6, 4, 2, ...
4, 2, 1, 5, ...
...
|
|
CROSSREFS
|
Cf. A269526 uses antidiagonals instead of the Hilbert curve and A274640 uses a square spiral.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|