A sequence of terms, a1, a2, a3, …….. ai, is generated as follows. The first term (a1) is chosen as 1. To obtain every subsequent term a coin is tossed. If a heads (H) appears, the next term is obtained by adding 2 to the previous term. If a tails (T) appears, only 1 is added to the previous term to obtain the next term. For example, the sequence corresponding to HTH is 1, 3, 4, 6. If a11 = 15, what is the maximum number of consecutive tails that could have appeared up to that term?

To solve this problem, we need to understand that the maximum number of consecutive tails that could have appeared up to the 11th term would be when the minimum number of heads have appeared. This is because each head adds 2 to the previous term, while each tail only adds 1.

Given that a11 = 15, we can work backwards to find the minimum number of heads that must have appeared.

1. Start with a11 = 15.
2. Subtract the initial term a1 = 1, which leaves us with 14.
3. Since each head adds 2 to the sequence, divide 14 by 2 to find the minimum number of heads. This gives us 7 heads.
4. Subtract the number of heads from the total number of terms up to a11. This gives us 11 - 7 = 4.

Therefore, the maximum number of consecutive tails that could have appeared up to the 11th term is 4.