#include<stdio.h> void main() { long long f[]; f[0]=1; f[1]=1; for(int i=2;i<n;i++) { f[i]=0; for(j=1;j<i;j++) { f[i]+=f[j-1]*f[i-j]; } [ } }
def findBTkinds(n:int) -> int: if n == 0: outcome = 1 return outcome elif n == 1: outcome = 1 return outcome else: outcome = 2 *(2 * n - 1) / (n + 1) * findBTkinds(n-1) return outcome