A279605 - cp's OEIS frontend

A279605 Triangle T(n, k) read by rows: minimal number of knight moves to reach the central square on a (2n+1) X (2n+1) board starting from the k-th outermost square counted from middle of first rank for k = 1..n+1, or -1 if reaching the central square is impossible.

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

[0, -1, -1, 4, 1, 2, 2, 3, 2, 3, 4, 3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 3, 4, 3, 4, 6, 5, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 4, 5, 4, 5, 4, 6, 7, 6, 5, 6, 5, 6, 5, 6, 5, 8, 7, 6, 7, 6, 5, 6, 5, 6, 5, 6, 8, 7, 8, 7, 6, 7, 6, 7, 6, 7, 6, 7, 8, 9, 8, 7, 8, 7, 6, 7, 6, 7, 6, 7, 6]

cp's OEIS Frontend

A279605 Triangle T(n, k) read by rows: minimal number of knight moves to reach the central square on a (2n+1) X (2n+1) board starting from the k-th outermost square counted from middle of first rank for k = 1..n+1, or -1 if reaching the central square is impossible.

Table of values

List of values

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

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

cp's OEIS Frontend

A279605 Triangle T(n, k) read by rows: minimal number of knight moves to reach the central square on a (2*n+1) X (2*n+1) board starting from the k-th outermost square counted from middle of first rank for k = 1..n+1, or -1 if reaching the central square is impossible.

Table of values

List of values

A279605 Triangle T(n, k) read by rows: minimal number of knight moves to reach the central square on a (2n+1) X (2n+1) board starting from the k-th outermost square counted from middle of first rank for k = 1..n+1, or -1 if reaching the central square is impossible.

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