OFFSET
0,3
LINKS
EXAMPLE
For n=2, the points visited are 2,1,-1,-4,0. Of those the one farthest from zero is -4 with a distance of 4, hence a(2) = 4.
PROG
(Python)
#spots - positions in order with possible repetition
#flee - positions from which we move away from zero with possible repetition
#stuck - positions from which we move to a spot already visited with possible repetition
def trip(n):
stucklist = list()
spotsvisited = [n]
leavingspots = list()
turn = 0
forbidden = {n}
while n != 0:
turn += 1
sign = n // abs(n)
st = sign * turn
if n - st not in forbidden:
n = n - st
else:
leavingspots.append(n)
if n + st in forbidden:
stucklist.append(n)
n = n + st
spotsvisited.append(n)
forbidden.add(n)
return {'stuck':stucklist, 'spots':spotsvisited,
'turns':turn, 'flee':leavingspots}
#Actual sequence
def a(n):
d = trip(n)
return max(abs(i) for i in d['spots'])
CROSSREFS
KEYWORD
nonn
AUTHOR
David Nacin, Mar 10 2019
STATUS
approved