an be the number of {A, B}-strings of length n with the property that every A is followed by an odd number of B's. Let a
Posted: Wed Jul 06, 2022 11:46 am
an be the number of {A, B}-strings of length n with the property that every A is followed by an odd number of B's. Let a) Find a recurrence for the sequences bn =a2n and cn = a2n+1. b) Find a closed form expression for the generating function associated to an.