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.

A324662 Starting at n, a(n) is the difference of the number of left moves and the number of right moves 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 2
3 2
4 4
5 4
6 3
7 3
8 4
9 4
10 4
11 4
12 5
13 5
14 5
15 5
16 5
17 6
18 6
19 6
20 8
21 6
22 7
23 7
24 7
25 9
26 7
27 7
28 7
29 7
30 3
31 7
32 7
33 7
34 7
35 8
36 8
37 8
38 7
39 7
40 8
41 9
42 9
43 9
44 10
45 9
46 10
47 10
48 10
49 10
50 10
51 10
52 10
53 10
54 10
55 10
56 10
57 10
58 10
59 10
60 10
61 10
62 10
63 10
64 11
65 11
66 11
67 12
68 12
69 12
70 12
71 12
72 12
73 12
74 12
75 12

List of values

[0, 1, 2, 2, 4, 4, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 8, 6, 7, 7, 7, 9, 7, 7, 7, 7, 3, 7, 7, 7, 7, 8, 8, 8, 7, 7, 8, 9, 9, 9, 10, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.