Consider the following sequence of numbers that are similar to (but not the same as) the Fibonacci

sequence:

P₁ = 1

P2 = 1

Pn=Pn-1+2 pn-2, for n ≥ 3

Prove by strong induction that for any integer n ≥ 1,

2n - (-1)n / 3