A065775 - cp's OEIS frontend

A065775 Array T read by diagonals: T(i,j)=least number of knight's moves on a chessboard (infinite in all directions) needed to move from (0,0) to (i,j).

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

[0, 3, 3, 2, 2, 2, 3, 1, 1, 3, 2, 2, 4, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 2, 2, 2, 4, 4, 5, 3, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 3, 3, 3, 3, 5, 5, 5, 6, 6, 4, 4, 4, 4, 4, 4, 4, 6, 6, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7]

cp's OEIS Frontend

A065775 Array T read by diagonals: T(i,j)=least number of knight's moves on a chessboard (infinite in all directions) needed to move from (0,0) to (i,j).

Table of values

List of values

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

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

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