A324665 - cp's OEIS frontend

A324665 Starting at n, a(n) is the total number of negative 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	0
2	2
3	0
4	17
5	17
6	0
7	939
8	6
9	6
10	0
11	8
12	73
13	73
14	7
15	0
16	48
17	445544
18	10
19	10
20	57947
21	0
22	30
23	16
24	16
25	782680
26	11
27	11
28	0
29	184
30	2650008
31	232081
32	232079
33	232079
34	232079
35	12
36	0
37	35
38	109811
39	109809
40	123
41	17
42	15
43	15
44	577
45	0
46	82
47	62
48	62
49	45
50	45
51	104
52	32
53	16
54	16
55	0
56	281
57	279

[0, 0, 2, 0, 17, 17, 0, 939, 6, 6, 0, 8, 73, 73, 7, 0, 48, 445544, 10, 10, 57947, 0, 30, 16, 16, 782680, 11, 11, 0, 184, 2650008, 232081, 232079, 232079, 232079, 12, 0, 35, 109811, 109809, 123, 17, 15, 15, 577, 0, 82, 62, 62, 45, 45, 104, 32, 16, 16, 0, 281, 279]

cp's OEIS Frontend

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