A324680 - cp's OEIS frontend

A324680 Starting at n, a(n) is the largest distance from zero among all positions from which a spot must be revisited on the next move, or zero if no such positions exist, 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.

n	a(n)
0	0
1	0
2	0
3	0
4	0
5	0
6	0
7	3442
8	0
9	0
10	0
11	27
12	140
13	139
14	0
15	0
16	84
17	3072845
18	0
19	0
20	638385
21	0
22	0
23	0
24	0
25	4869724
26	0
27	0
28	0
29	464
30	43807680
31	2117461
32	2117462
33	2117463
34	2117464
35	0
36	0
37	24
38	696919
39	696918
40	179
41	1
42	0
43	1
44	1920
45	0
46	148
47	86
48	85
49	84
50	83
51	190
52	63
53	0
54	0
55	0
56	1107

[0, 0, 0, 0, 0, 0, 0, 3442, 0, 0, 0, 27, 140, 139, 0, 0, 84, 3072845, 0, 0, 638385, 0, 0, 0, 0, 4869724, 0, 0, 0, 464, 43807680, 2117461, 2117462, 2117463, 2117464, 0, 0, 24, 696919, 696918, 179, 1, 0, 1, 1920, 0, 148, 86, 85, 84, 83, 190, 63, 0, 0, 0, 1107]

cp's OEIS Frontend

Table of values

List of values