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.

A183042 Least number of knight's moves from (0,0) to the segment of points (0,n), (1,n-1), ..., (n,0) on infinite chessboard.

Table of values

n a(n)
0 0
1 6
2 6
3 8
4 12
5 18
6 22
7 28
8 36
9 42
10 52
11 64
12 68
13 82
14 98
15 104
16 118
17 138
18 146
19 164
20 184
21 194
22 216
23 240
24 248
25 274
26 302
27 312
28 338
29 370
30 382
31 412
32 444
33 458
34 492
35 528
36 540
37 578
38 618
39 632
40 670
41 714
42 730
43 772
44 816
45 834
46 880
47 928
48 944
49 994

List of values

[0, 6, 6, 8, 12, 18, 22, 28, 36, 42, 52, 64, 68, 82, 98, 104, 118, 138, 146, 164, 184, 194, 216, 240, 248, 274, 302, 312, 338, 370, 382, 412, 444, 458, 492, 528, 540, 578, 618, 632, 670, 714, 730, 772, 816, 834, 880, 928, 944, 994]