cp's OEIS Frontend

A071153 Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.

%I A071153 #21 Jul 30 2017 21:24:52
%S A071153 0,1,20,11,300,201,210,120,111,4000,3001,3010,2020,2011,3100,2101,
%T A071153 2200,1300,1201,2110,1210,1120,1111,50000,40001,40010,30020,30011,
%U A071153 40100,30101,30200,20300,20201,30110,20210,20120,20111,41000,31001,31010
%N A071153 Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.
%C A071153 Note: this finite decimal representation works only up to the 6917th term, as the 6918th such word is already (10,0,0,0,0,0,0,0,0,0). The sequence A071154 shows the initial portion of this sequence sorted.
%H A071153 A. Karttunen, <a href="http://www.iki.fi/~kartturi/matikka/Nekomorphisms/gatomorf.htm">Gatomorphisms and other excursions amidst the plane trees and parenthesizations</a> (Includes the complete Scheme program for computing this sequence)
%H A071153 R. P. Stanley, <a href="http://www-math.mit.edu/~rstan/papers.html">Hipparchus, Plutarch, Schröder and Hough</a>, Am. Math. Monthly, Vol. 104, No. 4, p. 344, 1997.
%H A071153 R. P. Stanley, <a href="http://www-math.mit.edu/~rstan/ec/catalan.pdf">Exercises on Catalan and Related Numbers</a>
%H A071153 OEIS Wiki, <a href="/wiki/Łukasiewicz_words">Łukasiewicz words</a>
%H A071153 <a href="/index/Lu#Lukasiewicz">Index entries for sequences related to Łukasiewicz</a>
%H A071153 <a href="/index/Par#parens">Index entries for sequences related to parenthesizing</a>
%e A071153 The 11th term of A063171 is 10110010, corresponding to parenthesization ()(())(), thus its Łukasiewicz word is 3010. The 18th term of A063171 is 11011000, corresponding to parenthesization (()(())), thus its Łukasiewicz word is 1201. I.e., in the latter example there is one list on the top-level, which in turn contains two sublists, of which the first is zero elements long and the second is a sublist containing one empty sublist (the last zero is omitted).
%Y A071153 For n >= 1, the number of zeros in the term a(n) is given by A057514(n)-1.
%Y A071153 The first digit of each term is given by A057515.
%Y A071153 Cf. A014486, A059984, A059985, A071152, A071154.
%Y A071153 Corresponding factorial walk encoding: A071155 (A071157, A071159).
%Y A071153 a(n) = A079436(n)/10.
%K A071153 nonn,fini
%O A071153 0,3
%A A071153 _Antti Karttunen_, May 14 2002