Łukasiewicz words for the rooted plane binary trees (interpretation d in Stanley's exercise 19) 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.
A071152
Łukasiewicz words for the rooted plane binary trees (interpretation d in Stanley's exercise 19) 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.
Terms
- a(0) =0a(1) =20a(2) =2020a(3) =2200a(4) =202020a(5) =202200a(6) =220020a(7) =220200a(8) =222000a(9) =20202020a(10) =20202200a(11) =20220020a(12) =20220200a(13) =20222000a(14) =22002020a(15) =22002200a(16) =22020020a(17) =22020200a(18) =22022000a(19) =22200020a(20) =22200200a(21) =22202000a(22) =22220000a(23) =2020202020a(24) =2020202200
External references
- oeis: A071152