A084463 -id:A084463 - cp's OEIS frontend

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

Antti Karttunen, Jun 02 2003

nonn

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

Index entries for sequences related to juggling
A. Karttunen, Scheme-program for computing this sequence

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

A084464 Positions of odd juggling states in A084457, i.e., positions of nonzero-throws in A084458 - 1.

Original entry on oeis.org

0, 1, 2, 4, 5, 8, 9, 11, 13, 16, 18, 22, 23, 28, 29, 32, 35, 39, 41, 46, 48, 54, 55, 59, 62, 67, 70, 76, 78, 85, 86, 90, 94, 99, 103, 109, 112, 119, 121, 129, 130, 139, 140, 145, 150, 156, 160, 167, 170, 178, 180, 189, 191, 201, 202, 208, 213, 220, 224, 232, 235, 244

Offset: 1

Antti Karttunen, Jun 02 2003

nonn

Antti Karttunen, Scheme-program for computing this sequence

Complement: A084463. Used to compute A084467.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links