%I A072789
%S A072789 1,2,2,3,3,3,4,3,4,4,4,4,3,4,5,4,5,4,4,4,5,5,5,4,4,5,5,5,5,5,5,5,5,5,5,
%T A072789 4,5,4,6,5,5,6,5,5,6,5,6,6,5,5,5,6,6,5,6,5,6,6,6,6,6,6,6,6,5,5,5,5,5,6,
%U A072789 6,6,6,7,5,6,5,6,6,6,7,6,6,7,5,6,7,7,6,6,6,5,6,7,6,7,7,6,6,7,7,7,6,5,5
%N A072789 The size of the parenthesizations obtained with the global ranking/unranking 
               scheme presented in A072787-A072788.
%C A072789 To get a cleaner looking table, the term a(0)=0 is not listed here.
%Y A072789 A072790(n) gives the maximum position where the value n occurs. See the 
               comment at A072787. Same triangle computed modulo 2: A072792.
%Y A072789 Sequence in context: A051776 A073734 A062558 this_sequence A126302 A134674 
               A000121
%Y A072789 Adjacent sequences: A072786 A072787 A072788 this_sequence A072790 A072791 
               A072792
%K A072789 nonn,tabl
%O A072789 1,2
%A A072789 Antti Karttunen Jun 12 2002