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.

A324664 Starting at n, a(n) is the smallest distance from zero for which the next move is a step away from zero, or zero if no such move is ever made, 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 3
5 1
6 0
7 5
8 4
9 1
10 0
11 7
12 6
13 1
14 4
15 0
16 7
17 8
18 7
19 1
20 2
21 0
22 5
23 4
24 1
25 2
26 7
27 1
28 0
29 13
30 2
31 1
32 10
33 1
34 1
35 7
36 0
37 5
38 1
39 3
40 2
41 1
42 10
43 1
44 2
45 0
46 17
47 16
48 1
49 14
50 1
51 2
52 11
53 10
54 1
55 0
56 1
57 1
58 17
59 1
60 15
61 1
62 1
63 1
64 11
65 10
66 0
67 4
68 1
69 2
70 1
71 1
72 1
73 15
74 1
75 13
76 1
77 1
78 0
79 2
80 1
81 1

List of values

[0, 0, 1, 0, 3, 1, 0, 5, 4, 1, 0, 7, 6, 1, 4, 0, 7, 8, 7, 1, 2, 0, 5, 4, 1, 2, 7, 1, 0, 13, 2, 1, 10, 1, 1, 7, 0, 5, 1, 3, 2, 1, 10, 1, 2, 0, 17, 16, 1, 14, 1, 2, 11, 10, 1, 0, 1, 1, 17, 1, 15, 1, 1, 1, 11, 10, 0, 4, 1, 2, 1, 1, 1, 15, 1, 13, 1, 1, 0, 2, 1, 1]