%I #9 Jul 29 2017 13:11:37
%S 4,4,6,0,5,8,0,0,3,7,0,7,0,9,0,0,7,0,10,0,0,0,7,12,0,0,0,0,4,10,0,0,9,
%T 0,0,11,0,0,0,9,0,13,0,0,0,0,9,0,14,0,0,0,0,0,5,12,0,0,0,11,0,0,14,0,
%U 0,0,0,11,0,0,15,0,0,0,0,0,10,0,16,0,0,0,0,0,0,5,13,0,0,0,13,0,0,0,15,0,0,0
%N An infinite juggling sequence using three balls: a(n) is the least (lowest) throw needed to ensure that none of the juggling states A084457[n..n+A006519(n)-1] occurs in A084457[0..n-1].
%C The condition is equivalent to that A000265(A084457(n)) does not occur in A084457[0..n-1].
%H <a href="/index/J#Juggling">Index entries for sequences related to juggling</a>
%H A. Karttunen, <a href="/A084507/a084507.scm.txt">Scheme-program for computing this sequence</a>
%Y Variant: A084452. Positions of zeros, minus one: A084463.
%K nonn
%O 1,1
%A _Antti Karttunen_, Jun 02 2003