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

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

Offset

1,1

Comments

The condition is equivalent to that A000265(A084457(n)) does not occur in A084457[0..n-1].

Links

Table of n, a(n) for n=1..98.

Index entries for sequences related to juggling

A. Karttunen, Scheme-program for computing this sequence

Crossrefs

Variant: A084452. Positions of zeros, minus one: A084463.

Sequence in context: A098821 A363322 A142154 * A248933 A353416 A110356

Adjacent sequences: A084455 A084456 A084457 * A084459 A084460 A084461

Keyword

nonn

Author

Antti Karttunen, Jun 02 2003

Status

approved