|
|
A084501
|
|
An infinite juggling sequence of three balls: successively larger ground-state 3-ball site swaps listed in lexicographic order.
|
|
11
|
|
|
3, 3, 3, 4, 2, 3, 3, 3, 3, 4, 2, 4, 2, 3, 4, 4, 1, 5, 2, 2, 5, 3, 1, 3, 3, 3, 3, 3, 3, 4, 2, 3, 4, 2, 3, 3, 4, 4, 1, 3, 5, 2, 2, 3, 5, 3, 1, 4, 2, 3, 3, 4, 2, 4, 2, 4, 4, 1, 3, 4, 4, 4, 0, 4, 5, 1, 2, 4, 5, 3, 0, 5, 2, 2, 3, 5, 2, 4, 1, 5, 3, 1, 3, 5, 3, 4, 0, 5, 5, 1, 1, 5, 5, 2, 0, 6, 2, 2, 2, 6, 2, 3, 1, 6, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Every possible 3-ball asynchronic site swap of finite period occurs as a subsequence of this sequence. E.g., "51" (three-ball shower) occurs first time at a(65)=5, a(66)=1.
We obtain the sequence by traversing each possible loop of successively larger lengths in 3-ball state graph as depicted in Polster's book, or section 7 of Knutson's Siteswap FAQ (but not limited by throw height), starting from and ending to the ground state 7 (xxx) and by concatenating those sequences in lexicographic order.
One can take any subsequence A084501[i..j] such that A084503(i-1) = A084503(j) = 7 and try to juggle it periodically or give it to one of the Siteswap animators available at J.I.S., e.g., by taking the first 39 terms, one gets a site swap pattern "333423333424234415225313333334234233441".
|
|
REFERENCES
|
B. Polster, The Mathematics of Juggling, Springer-Verlag, 2003, p. 45.
|
|
LINKS
|
|
|
EXAMPLE
|
The successive site swaps are: 3; 3,3; 4,2; 3,3,3; 3,4,2; 4,2,3; 4,4,1; 5,2,2; 5,3,1; 3,3,3,3; ... See A084502.
|
|
CROSSREFS
|
The number of such site swaps of length n is given by A084509.
First position where n appears: A084507.
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|