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.

A246924 8 X 8 square array read by rows: T(i,j) = number of moves of a knight to reach the square (i,j) when starting from the square (1,2).

Table of values

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

List of values

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