This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209644 Lukasiewicz-words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else. 2

%I

%S 0,1,20,11,300,210,120,111,4000,3100,2200,1300,2110,1210,1120,1111,

%T 50000,41000,32000,23000,14000,31100,22100,13100,21200,12200,11300,

%U 21110,12110,11210,11120,11111,600000,510000,420000,330000,240000,150000,411000,321000,231000,141000,312000,222000,132000,213000

%N Lukasiewicz-words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else.

%C 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).

%H A. Karttunen, <a href="/A014486/a014486.pdf">Corresponding Lukasiewicz-words (with a trailing zero) illustrated on 1, 2, 3, 4, 6, 7, 8, 9, 14, 16, 17th, etc. row in this illustration.</a>

%H Antti Karttunen, <a href="/A209644/b209644.txt">Table of n, a(n) for n = 0..511</a>

%F a(n) = A071153(A209643(n)).

%Y A209643 gives the positions of these terms in A071153 (A014486). Cf. also A071160.

%K nonn,base,fini

%O 0,3

%A _Antti Karttunen_, Mar 24 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .