python

Using recursive thinking to define a function implement the following pattern: if n = 0 or n = 1, then f(n) = 1 if n>1, then f(n) = 2x f(n-2) + 3x f(n-1)