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.

A324661 Starting at n, a(n) is the total number of moves made to the left 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 1
2 3
3 2
4 14
5 15
6 3
7 864
8 8
9 9
10 4
11 15
12 64
13 65
14 10
15 5
16 62
17 390904
18 13
19 14
20 66452
21 6
22 29
23 18
24 19
25 610401
26 15
27 16
28 7
29 218
30 4434563
31 266008
32 266007
33 266008
34 266009
35 17
36 8
37 51
38 106681
39 106680
40 128
41 21
42 20
43 21
44 505
45 9
46 77
47 60
48 61
49 46
50 47
51 110
52 35
53 22
54 23
55 10
56 327

List of values

[0, 1, 3, 2, 14, 15, 3, 864, 8, 9, 4, 15, 64, 65, 10, 5, 62, 390904, 13, 14, 66452, 6, 29, 18, 19, 610401, 15, 16, 7, 218, 4434563, 266008, 266007, 266008, 266009, 17, 8, 51, 106681, 106680, 128, 21, 20, 21, 505, 9, 77, 60, 61, 46, 47, 110, 35, 22, 23, 10, 327]