A344046 - cp's OEIS frontend

A344046 Squares visited by a knight moving on a spirally numbered board where the knight moves to the smallest unvisited square using the fewest possible steps. If two or more equal length paths exist it chooses the path with the lowest sum of visited numbers, and if two paths have the same sum of visited numbers it chooses the one that visits the smallest number.

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

[1, 14, 5, 2, 15, 6, 3, 8, 11, 4, 7, 46, 9, 12, 53, 10, 51, 28, 13, 58, 33, 16, 19, 68, 17, 64, 35, 18, 69, 20, 23, 76, 21, 72, 41, 22, 77, 24, 27, 50, 25, 80, 47, 26, 83, 52, 29, 32, 57, 30, 89, 54, 31, 92, 59, 34, 97, 36, 39, 104, 37, 100, 63, 38, 105, 40, 107, 42, 45, 114, 43, 110, 71, 44, 115]

cp's OEIS Frontend

Table of values

List of values

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

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

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