Starting at n, a(n) is the number of times we travel to a position already 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.
A324674
Starting at n, a(n) is the number of times we travel to a position already 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.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =83a(8) =0a(9) =0a(10) =0a(11) =1a(12) =7a(13) =7a(14) =0a(15) =0a(16) =3a(17) =59171a(18) =0a(19) =0a(20) =10456a(21) =0a(22) =0a(23) =0a(24) =0a(25) =89111a(26) =0a(27) =0a(28) =0a(29) =15
External references
- oeis: A324674