|
%I #21 Aug 12 2022 09:23:54
%S 0,0,1,0,2,3,3,0,9,6,4,5,4,5,7,0,18,10,4,7,10,14,31,15,11,9,25,16,19,
%T 23,12,0,28,15,21,29,25,17,16,38,26,30,18,26,49,29,43,29,38,23,37,31,
%U 55,43,46,53,25,42,62,51,29,51,56,0,31,56,69,22,35,65
%N The number of counterclockwise steps during the grasshopper procedure.
%C The grasshopper procedure: n positions are evenly spaced around a circle, a grasshopper hops randomly to any position, after the k-th hop, the grasshopper looks clockwise and counterclockwise k positions. If one of the positions has been visited less often then the other, it hops there; if both positions have been visited an equal number of times, it hops k steps in the clockwise position. (See Mathematics Stack Exchange link for more details.)
%C Conjecture: a(n)=0 if and only if n = 2^k.
%H Peter Kagey, <a href="/A329232/b329232.txt">Table of n, a(n) for n = 1..2048</a>
%H Mathematics Stack Exchange User Vepir, <a href="https://math.stackexchange.com/q/3418970/121988">Grasshopper jumping on circles</a>
%Y Cf. A329230, A329231, A329233.
%K nonn,walk
%O 1,5
%A _Peter Kagey_, Nov 10 2019
|
