A084452 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].

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, 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, 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

Offset: 1

Author

Antti Karttunen, Jun 02 2003

Keywords

• nonn

Comments

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.

Links

• Index entries for sequences related to juggling
• A. Karttunen, Scheme-program for computing this sequence
• A. Knutson, Siteswap FAQ, Section 7, A deeper level: landing schedules, or juggling states