Starting at n, a(n) is the total number of positive 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.
A324666
Starting at n, a(n) is the total number of positive 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) =1a(2) =2a(3) =2a(4) =7a(5) =9a(6) =3a(7) =786a(8) =6a(9) =8a(10) =4a(11) =18a(12) =50a(13) =52a(14) =8a(15) =5a(16) =71a(17) =336258a(18) =10a(19) =12a(20) =74949a(21) =6a(22) =21a(23) =13a(24) =15a(25) =438113a(26) =12a(27) =14a(28) =7a(29) =245
External references
- oeis: A324666