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.

A047878 a(n) is the least number of knight's moves from corner (0,0) to n-th diagonal of unbounded chessboard.

Table of values

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

List of values

[0, 3, 2, 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 6, 5, 6, 7, 6, 7, 8, 7, 8, 9, 8, 9, 10, 9, 10, 11, 10, 11, 12, 11, 12, 13, 12, 13, 14, 13, 14, 15, 14, 15, 16, 15, 16, 17, 16, 17, 18, 17, 18, 19, 18, 19, 20, 19, 20, 21, 20, 21, 22, 21, 22, 23, 22, 23, 24, 23, 24, 25]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.