A324666 - cp's OEIS frontend

A324666 Starting at n, a(n) is the total number of positive positions 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	2
3	2
4	7
5	9
6	3
7	786
8	6
9	8
10	4
11	18
12	50
13	52
14	8
15	5
16	71
17	336258
18	10
19	12
20	74949
21	6
22	21
23	13
24	15
25	438113
26	12
27	14
28	7
29	245
30	6219115
31	299928
32	299928
33	299930
34	299932
35	14
36	8
37	59
38	103544
39	103544
40	125
41	16
42	16
43	18
44	423
45	9
46	62
47	48
48	50
49	37
50	39
51	106
52	28
53	18
54	20
55	10
56	363

[0, 1, 2, 2, 7, 9, 3, 786, 6, 8, 4, 18, 50, 52, 8, 5, 71, 336258, 10, 12, 74949, 6, 21, 13, 15, 438113, 12, 14, 7, 245, 6219115, 299928, 299928, 299930, 299932, 14, 8, 59, 103544, 103544, 125, 16, 16, 18, 423, 9, 62, 48, 50, 37, 39, 106, 28, 18, 20, 10, 363]

cp's OEIS Frontend

A324666 Starting at n, a(n) is the total number of positive positions 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