In combinatorial mathematics, the Lobb number Lm, n counts the number of ways that n + m open parentheses can be arranged to form the start of a valid sequence of balanced parentheses.
The Lobb number are parameterized by two non-negative integers m and n with n >= m >= 0. It can be obtained by:
Lobb Number is also used to count the number of ways in which n + m copies of the value +1 and n – m copies of the value -1 may be arranged into a sequence such that all of the partial sums of the sequence are non- negative.
Input : n = 3, m = 2 Output : 5 Input : n =5, m =3 Output :35
The idea is simple, we use a function that computes binomial coefficients for given values. Using this function and above formula, we can compute Lobb numbers.
- Count number of triplets with product equal to given number with duplicates allowed | Set-2
- Count number of triplets with product equal to given number with duplicates allowed
- Number of ways to represent a number as sum of k fibonacci numbers
- Super Ugly Number (Number whose prime factors are in given set)
- Minimum number of squares whose sum equals to given number n
- Finding number of digits in n'th Fibonacci number
- Number of compositions of a natural number
- Get the kth smallest number using the digits of the given number
- Check if a number is an Achilles number or not
- Check if the given number is Ore number or not
- Number of digits in the nth number made of given four digits
- Number of NGEs to the right
- N-th polite number
- Motzkin number
- Eulerian Number
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.