A361154 - cp's OEIS frontend

A361154 Consider the square grid with cells {(x,y), x, y >= 0}; label the cells by downwards antidiagonals with nonnegative integers so that cells which are a knight's move apart have different labels; always choose smallest possible label.

n	a(n)
0	0
1	0
2	0
3	1
4	0
5	1
6	1
7	2
8	2
9	1
10	0
11	1
12	2
13	1
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	1
22	0
23	3
24	1
25	3
26	0
27	1
28	1
29	1
30	2
31	4
32	4
33	2
34	1
35	1
36	0
37	1
38	2
39	3
40	0
41	3
42	2
43	1
44	0
45	0
46	0
47	2
48	2
49	0
50	0
51	2
52	2
53	0
54	0
55	1
56	0
57	3
58	3
59	1
60	0
61	1
62	3
63	3
64	0
65	1
66	1
67	1
68	2
69	3
70	1
71	2
72	2
73	1
74	3
75	2
76	1
77	1
78	0
79	1
80	2
81	3
82	0
83	1
84	2
85	1
86	0
87	3
88	2
89	1
90	0

[0, 0, 0, 1, 0, 1, 1, 2, 2, 1, 0, 1, 2, 1, 0, 0, 0, 2, 2, 0, 0, 1, 0, 3, 1, 3, 0, 1, 1, 1, 2, 4, 4, 2, 1, 1, 0, 1, 2, 3, 0, 3, 2, 1, 0, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 1, 0, 3, 3, 1, 0, 1, 3, 3, 0, 1, 1, 1, 2, 3, 1, 2, 2, 1, 3, 2, 1, 1, 0, 1, 2, 3, 0, 1, 2, 1, 0, 3, 2, 1, 0]

cp's OEIS Frontend

A361154 Consider the square grid with cells {(x,y), x, y >= 0}; label the cells by downwards antidiagonals with nonnegative integers so that cells which are a knight's move apart have different labels; always choose smallest possible label.

Table of values

List of values

n	a(n)
0	0
1	0
2	0
3	1
4	0
5	1
6	1
7	2
8	2
9	1
10	0
11	1
12	2
13	1
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	1
22	0
23	3
24	1
25	3
26	0
27	1
28	1
29	1
30	2
31	4
32	4
33	2
34	1
35	1
36	0
37	1
38	2
39	3
40	0
41	3
42	2
43	1
44	0
45	0
46	0
47	2
48	2
49	0
50	0
51	2
52	2
53	0
54	0
55	1
56	0
57	3
58	3
59	1
60	0
61	1
62	3
63	3
64	0
65	1
66	1
67	1
68	2
69	3
70	1
71	2
72	2
73	1
74	3
75	2
76	1
77	1
78	0
79	1
80	2
81	3
82	0
83	1
84	2
85	1
86	0
87	3
88	2
89	1
90	0

n	a(n)
0	0
1	0
2	0
3	1
4	0
5	1
6	1
7	2
8	2
9	1
10	0
11	1
12	2
13	1
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	1
22	0
23	3
24	1
25	3
26	0
27	1
28	1
29	1
30	2
31	4
32	4
33	2
34	1
35	1
36	0
37	1
38	2
39	3
40	0
41	3
42	2
43	1
44	0
45	0
46	0
47	2
48	2
49	0
50	0
51	2
52	2
53	0
54	0
55	1
56	0
57	3
58	3
59	1
60	0
61	1
62	3
63	3
64	0
65	1
66	1
67	1
68	2
69	3
70	1
71	2
72	2
73	1
74	3
75	2
76	1
77	1
78	0
79	1
80	2
81	3
82	0
83	1
84	2
85	1
86	0
87	3
88	2
89	1
90	0

n	a(n)
0	0
1	0
2	0
3	1
4	0
5	1
6	1
7	2
8	2
9	1
10	0
11	1
12	2
13	1
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	1
22	0
23	3
24	1
25	3
26	0
27	1
28	1
29	1
30	2
31	4
32	4
33	2
34	1
35	1
36	0
37	1
38	2
39	3
40	0
41	3
42	2
43	1
44	0
45	0
46	0
47	2
48	2
49	0
50	0
51	2
52	2
53	0
54	0
55	1
56	0
57	3
58	3
59	1
60	0
61	1
62	3
63	3
64	0
65	1
66	1
67	1
68	2
69	3
70	1
71	2
72	2
73	1
74	3
75	2
76	1
77	1
78	0
79	1
80	2
81	3
82	0
83	1
84	2
85	1
86	0
87	3
88	2
89	1
90	0