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.
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.
Terms
- a(0) =0a(1) =0a(2) =2a(3) =0a(4) =17a(5) =17a(6) =0a(7) =939a(8) =6a(9) =6a(10) =0a(11) =8a(12) =73a(13) =73a(14) =7a(15) =0a(16) =48a(17) =445544a(18) =10a(19) =10a(20) =57947a(21) =0a(22) =30a(23) =16a(24) =16a(25) =782680a(26) =11a(27) =11a(28) =0a(29) =184
External references
- oeis: A324665