OFFSET
0,8
EXAMPLE
For n=43, the points visited are 43, 42, 40, 37, 33, 28, 22, 15, 7, -2, 8, -3, 9, -4, 10, -5, 11, -6, 12, -7, 13, -8, 14, -9, -33, -58, -32, -59, -31, -60, -30, 1, 33, 0. The only time we revisit a spot is when we move from 1 to 33. As this only occurs for one positive number, a(43)=1.
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 sum(1 for i in d['stuck'] if i > 0)
CROSSREFS
KEYWORD
nonn
AUTHOR
David Nacin, Mar 10 2019
STATUS
approved