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.

A324673 Starting at n, a(n) is the length of the smallest interval containing all points visited 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.

Table of values

n a(n)
0 0
1 1
2 6
3 3
4 68
5 72
6 6
7 13205
8 31
9 36
10 10
11 104
12 836
13 836
14 43
15 15
16 570
17 9518374
18 57
19 60
20 1548481
21 21
22 203
23 80
24 87
25 15466141
26 71
27 71
28 28
29 2436
30 118129102
31 6815959
32 6815959
33 6815959
34 6815959
35 86
36 36
37 560
38 2261901
39 2261901
40 1091
41 103
42 103
43 103
44 6831
45 45
46 758
47 499

List of values

[0, 1, 6, 3, 68, 72, 6, 13205, 31, 36, 10, 104, 836, 836, 43, 15, 570, 9518374, 57, 60, 1548481, 21, 203, 80, 87, 15466141, 71, 71, 28, 2436, 118129102, 6815959, 6815959, 6815959, 6815959, 86, 36, 560, 2261901, 2261901, 1091, 103, 103, 103, 6831, 45, 758, 499]