Problem Statement

Catalan numbers are a sequence of numbers which can be defined directly: Or recursively: Or alternatively (also recursive):

Implement at least one of these algorithms and print out the first 15 Catalan numbers with each. Memoization   is not required, but may be worth the effort when using the second method above.

Let's start with the solution:

import math.big

fn main() {
    mut b:= big.zero_int
    for n := i64(0); n < 15; n++ {
		b = big.integer_from_i64(n)
		b = (b*big.two_int).factorial()/(b.factorial()*(b*big.two_int-b).factorial())
        println(b/big.integer_from_i64(n+1))
    }
}