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.

A324663 Starting at n, a(n) is the number of moves made away from zero according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away from zero instead.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 9
5 10
6 0
7 740
8 2
9 3
10 0
11 7
12 48
13 49
14 2
15 0
16 39
17 348242
18 3
19 4
20 59273
21 0
22 12
23 5
24 6
25 523146
26 3
27 4
28 0
29 177
30 3533234
31 241226
32 241225
33 241226
34 241227
35 3
36 0
37 28
38 101615
39 101614
40 93
41 5
42 4
43 5
44 420
45 0
46 49
47 34
48 35
49 23
50 24
51 84
52 13
53 4
54 5
55 0
56 262
57 261
58 260
59 221950

List of values

[0, 0, 1, 0, 9, 10, 0, 740, 2, 3, 0, 7, 48, 49, 2, 0, 39, 348242, 3, 4, 59273, 0, 12, 5, 6, 523146, 3, 4, 0, 177, 3533234, 241226, 241225, 241226, 241227, 3, 0, 28, 101615, 101614, 93, 5, 4, 5, 420, 0, 49, 34, 35, 23, 24, 84, 13, 4, 5, 0, 262, 261, 260, 221950]