If a sequence is defined recursively as follows: a(1) = 3, a(n) = 2a(n-1) + 1 for n > 1, what is the value of a(5)?
We have been given a recursive formula for the sequence and the initial term a(1) = 3. We need to find the value of a(5). Let's work through the terms step by step:

a(2) = 2a(1) + 1
         = 2 * 3 + 1
         = 7

a(3) = 2a(2) + 1
         = 2 * 7 + 1
         = 15

a(4) = 2a(3) + 1
         = 2 * 15 + 1
         = 31

a(5) = 2a(4) + 1
         = 2 * 31 + 1
         = 63

So, the value of a(5) is 63.