I am stuck on this question from cormen(unsolved of course) and need your help

p(n)={1 ifn=1
{summation of k=1 to n-1 P(k)P(n-k) ifn>=2

Prove that solution of this recurrance is omega(2^n) by substitution.