

A071160


Łukasiewicz words that are also valid asynchronic siteswap juggling patterns.


4



0, 1, 20, 11, 300, 201, 120, 111, 4000, 3001, 2020, 2011, 1300, 1201, 1120, 1111, 50000, 40001, 30020, 30011, 20300, 20201, 20120, 20111, 14000, 13001, 12020, 12011, 11300, 11201, 11120, 11111, 600000, 500001, 400020, 400011, 300300
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

Note: this finite decimal representation works only up to the 511th term, as the 512th such word is already (10,0,0,0,0,0,0,0,0,0). The sequence A071161 shows the initial portion of this sequence sorted.


LINKS

Peter J. Beek and Arthur Lewbel, The Science of Juggling, Scientific American, Nov, 1995, Vol. 273, Number 5, pp. 9297.


FORMULA

Construction: starting from the most significant (the leftmost) bit, replace each 1bit in the binary expansion of n with the distance to the next 1bit to the right, allowing a cyclic wrapover from the leastsignificant 1bit to the most significant 1bit. I.e. from 22 = 10110 in binary we get 20120, the 22nd term of this sequence.


CROSSREFS



KEYWORD

nonn,fini


AUTHOR



STATUS

approved



