Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T01:40:29.798Z Has data issue: false hasContentIssue false

Lobb's generalisation of Catalan's parenthesisation problem revisited

Published online by Cambridge University Press:  23 January 2015

Thomas Koshy*
Affiliation:
Department of Mathematics, Framingham State University, Framingham, MA 01701-9101, USA
Get access

Extract

In 1838, the Belgian mathematician Eugene C. Catalan (1814-1894) discovered that the number Cn of well-fonned sequences, with n pairs of left and right parentheses, is given by where n > 0 [1, 2]. For example, there are exactly five well-formed sequences with three pairs of left and right parentheses: ()()(), ()(()), (())(), (()()), ((())). The case n = 0 yields the null sequence, often denoted by λ. Notice that ()) and ((()()), for example, are not correctly parenthesised.

Information

Type
Articles
Copyright
Copyright © The Mathematical Association 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable