The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2009  
         
  Article:   A NOTE ON A PROBLEM OF ŢÂMBULEA.

Authors:  ZOLTÁN KÁSA.
 
       
         
  Abstract:  In [6] and [7] L. Ţâmbulea studied the number of positive integers sequences (s1, s2, ..., s2n+1) with the properties: s1 = s2n+1= 1 and |si - si+1| = 1 for each i between 1 and 2n. In this note we discuss the algorithm to code this sequences by Dyck words and several related problems.
Key words and phrases. sequences of integers, Catalan numbers, Dyck words.
 
         
     
         
         
      Back to previous page