|
%I #9 Jul 29 2017 12:46:09
%S 4,4,4,0,5,5,5,0,0,6,3,5,0,5,0,6,6,0,6,0,0,7,3,0,6,6,0,0,7,0,6,6,0,0,
%T 0,7,7,7,0,0,0,0,8,4,7,0,0,7,0,0,8,5,0,0,7,0,7,0,8,0,0,8,0,8,0,0,9,0,
%U 0,7,0,7,0,0,0,8,8,0,8,0,0,0,0,9,3,0,8,1,7,0,0,0,9,0,8,8,0,0,0,0,0,9,5,8,0
%N An infinite juggling sequence with three balls: a(n) is zero when A084451(n-1) is even, otherwise the least (lowest) throw such that the resulting next juggling state A084451(n) does not occur in A084451[0..n-1].
%C Note that after the zero-throws the resulting next juggling state might be one encountered before. See A084458 for variant in which this does not happen.
%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>
%H A. Knutson, <a href="http://www.juggling.org/help/siteswap/faq.html#deep">Siteswap FAQ, Section 7, A deeper level: landing schedules, or juggling states</a>
%K nonn
%O 1,1
%A _Antti Karttunen_, Jun 02 2003
|
