cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A232007 Maximal number of moves needed by a knight to reach every square from a fixed position on an n X n chessboard, or -1 if it is not possible to reach every square.

Table of values

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

List of values

[0, -1, -1, 5, 4, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 12, 12, 13, 14, 14, 15, 16, 16, 17, 18, 18, 19, 20, 20, 21, 22, 22, 23, 24, 24, 25, 26, 26, 27, 28, 28, 29, 30, 30, 31, 32, 32, 33, 34, 34, 35, 36, 36, 37, 38, 38, 39, 40, 40, 41, 42, 42, 43, 44, 44, 45, 46, 46]