A324671 - cp's OEIS frontend

A324671 Starting at n, a(n) is the distance from zero of the farthest point 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 from zero instead.

n	a(n)
0	0
1	1
2	4
3	3
4	47
5	46
6	6
7	6843
8	23
9	22
10	10
11	72
12	471
13	470
14	29
15	15
16	352
17	4843985
18	39
19	38
20	891114
21	21
22	102
23	57
24	56
25	7856204
26	45
27	44
28	28
29	1700
30	61960674
31	3702823
32	3702824
33	3702825
34	3702826
35	51
36	36
37	370
38	1213998
39	1213997
40	596
41	62
42	61
43	60
44	3855
45	45
46	417
47	260
48	261
49	237

[0, 1, 4, 3, 47, 46, 6, 6843, 23, 22, 10, 72, 471, 470, 29, 15, 352, 4843985, 39, 38, 891114, 21, 102, 57, 56, 7856204, 45, 44, 28, 1700, 61960674, 3702823, 3702824, 3702825, 3702826, 51, 36, 370, 1213998, 1213997, 596, 62, 61, 60, 3855, 45, 417, 260, 261, 237]

cp's OEIS Frontend

A324671 Starting at n, a(n) is the distance from zero of the farthest point 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 from zero instead.

Table of values

List of values