How do I show that this sequence satisfies the given recurrence relation?
Let c0,c1,c2,... be defined by the formula c subscript n = 2^n - 1 for all integers n ≥ 0.
Show that this sequence satisfies the recurrence relation
b subscript k = 4b subscipt k-1
I apologize for the poor formatting
Eventually, it gets to c subscript k-1 = 2^k-1 -1 and I have no idea how