GeneratingFunction SpecialSequence Difficult

Problem - 4511

Solve the recursion $$a_n=\sum^{n-1}_{k=0}a_{k}a_{n-k-1}=a_0a_{n-1}+a_1a_{n-2}+\cdots+a_{n-1}a_0$$

where $a_0=a_1=1$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error