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.

A324660 Starting at n, a(n) is the total number of moves made to the right 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 10
5 11
6 0
7 861
8 4
9 5
10 0
11 11
12 59
13 60
14 5
15 0
16 57
17 390898
18 7
19 8
20 66444
21 0
22 22
23 11
24 12
25 610392
26 8
27 9
28 0
29 211
30 4434560
31 266001
32 266000
33 266001
34 266002
35 9
36 0
37 43
38 106674
39 106673
40 120
41 12
42 11
43 12
44 495
45 0
46 67
47 50
48 51
49 36
50 37
51 100
52 25
53 12
54 13
55 0
56 317
57 316

List of values

[0, 0, 1, 0, 10, 11, 0, 861, 4, 5, 0, 11, 59, 60, 5, 0, 57, 390898, 7, 8, 66444, 0, 22, 11, 12, 610392, 8, 9, 0, 211, 4434560, 266001, 266000, 266001, 266002, 9, 0, 43, 106674, 106673, 120, 12, 11, 12, 495, 0, 67, 50, 51, 36, 37, 100, 25, 12, 13, 0, 317, 316]