A071161 -id:A071161 - cp's OEIS frontend

A071154 Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero.

1, 11, 20, 111, 120, 201, 210, 300, 1111, 1120, 1201, 1210, 1300, 2011, 2020, 2101, 2110, 2200, 3001, 3010, 3100, 4000, 11111, 11120, 11201, 11210, 11300, 12011, 12020, 12101, 12110, 12200, 13001, 13010, 13100, 14000, 20111, 20120, 20201

Offset: 1

Antti Karttunen, May 14 2002

The initial portion of this sequence (up to the 6917th term) is equal to A071153 (Łukasiewicz words for rooted plane trees) sorted in ascending order.

OEIS Wiki, Łukasiewicz words
Index entries for sequences related to Łukasiewicz

Subset of A061384. Superset of A071161.

Cf. A014486 (totally balanced binary numbers), A071153.

isok(n) = {my(s = 0); my(d = digits(n)); for (k=1, #d, s += d[k]-1; if (s<0, return (0));); if (s, 0, 1);} \\ Michel Marcus, Oct 16 2015

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

Original entry on oeis.org

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

Offset: 0

Antti Karttunen, May 14 2002

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.

Peter J. Beek and Arthur Lewbel, The Science of Juggling, Scientific American, Nov, 1995, Vol. 273, Number 5, pp. 92-97.
Joe Buhler and R. L. Graham, Juggling Drops and Descents, Amer. Math. Monthly, 101, (no. 6) 1994, 507 - 519.
Juggling Information Service, Site Swap FAQs
A. Karttunen, Gatomorphisms and other excursions amidst the plane trees and parenthesizations (Includes the complete Scheme program for computing this sequence)
R. P. Stanley, Hipparchus, Plutarch, Schröder and Hough, Am. Math. Monthly, Vol. 104, No. 4, p. 344, 1997.
OEIS Wiki, Łukasiewicz words
Index entries for sequences related to Łukasiewicz

Subset of A071153.

Cf. A060495, A060498, A065177, A071162, A071163.

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

a(n) = A071161(A054429(n)).

cp's OEIS Frontend

A071154 Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI