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.

A324274 a(n) is the number of squares visited by a single pawn move for an even square and a double pawn move for an odd square on a diagonally numbered board and moving to the lowest available unvisited square of different parity at each step from subsequent starting squares n; or a(n) = 0 for an infinite length.

Table of values

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

List of values

[20, 0, 8, 17, 6, 9, 4, 7, 0, 11, 16, 5, 18, 0, 10, 19, 8, 19, 8, 11, 12, 25, 6, 9, 6, 9, 0, 13, 24, 7, 20, 7, 20, 0, 12, 15, 24, 21, 26, 21, 10, 21, 10, 13, 14, 27, 8, 27, 8, 11, 8, 11, 0, 15, 16, 33, 22, 9, 22, 9, 22, 9, 22, 0, 14, 17, 32, 23]