[seqfan] Re: question on a recursively defined sequence

[T. D. Noe]

At 4:05 PM -0800 2/22/09, Jim Nastos wrote:
>Telescoping once to remove the linear term gives a nicer recurrence
>(only makes one recursive call
>instead of two.) I'm surprised it's not written in the OEIS page.
>
>t(1) = 1
>t(2) = 3
>t(n) = 3 + 2^t(n-1)

This cannot be correct because your t(n) has 3 bits set for all n>2.  The
original t(n) has n bits set.

Tony