A275103 - cp's OEIS frontend

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.

n	a(n)
0	1
1	2
2	3
3	4
4	2
5	3
6	1
7	5
8	4
9	2
10	5
11	1
12	2
13	6
14	5
15	4
16	3
17	5
18	1
19	6
20	7
21	8
22	9
23	10
24	6
25	3
26	4
27	8
28	7
29	9
30	8
31	11
32	2
33	1
34	8
35	4
36	1
37	6
38	10
39	3
40	9
41	5
42	7
43	11
44	3
45	10
46	6
47	4
48	9
49	10
50	1
51	7
52	11
53	3
54	9
55	12
56	4
57	8
58	5
59	7
60	11
61	13
62	12
63	6

[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]

cp's OEIS Frontend

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.

Table of values

List of values

n	a(n)
0	1
1	2
2	3
3	4
4	2
5	3
6	1
7	5
8	4
9	2
10	5
11	1
12	2
13	6
14	5
15	4
16	3
17	5
18	1
19	6
20	7
21	8
22	9
23	10
24	6
25	3
26	4
27	8
28	7
29	9
30	8
31	11
32	2
33	1
34	8
35	4
36	1
37	6
38	10
39	3
40	9
41	5
42	7
43	11
44	3
45	10
46	6
47	4
48	9
49	10
50	1
51	7
52	11
53	3
54	9
55	12
56	4
57	8
58	5
59	7
60	11
61	13
62	12
63	6

n	a(n)
0	1
1	2
2	3
3	4
4	2
5	3
6	1
7	5
8	4
9	2
10	5
11	1
12	2
13	6
14	5
15	4
16	3
17	5
18	1
19	6
20	7
21	8
22	9
23	10
24	6
25	3
26	4
27	8
28	7
29	9
30	8
31	11
32	2
33	1
34	8
35	4
36	1
37	6
38	10
39	3
40	9
41	5
42	7
43	11
44	3
45	10
46	6
47	4
48	9
49	10
50	1
51	7
52	11
53	3
54	9
55	12
56	4
57	8
58	5
59	7
60	11
61	13
62	12
63	6

n	a(n)
0	1
1	2
2	3
3	4
4	2
5	3
6	1
7	5
8	4
9	2
10	5
11	1
12	2
13	6
14	5
15	4
16	3
17	5
18	1
19	6
20	7
21	8
22	9
23	10
24	6
25	3
26	4
27	8
28	7
29	9
30	8
31	11
32	2
33	1
34	8
35	4
36	1
37	6
38	10
39	3
40	9
41	5
42	7
43	11
44	3
45	10
46	6
47	4
48	9
49	10
50	1
51	7
52	11
53	3
54	9
55	12
56	4
57	8
58	5
59	7
60	11
61	13
62	12
63	6