Four Bits Of History

A two-level adaptive predictor keeps an $n$-bit branch history register and one 2-bit saturating counter per history pattern, so there are $2^n$ counters. Take $n = 4$: 16 counters, indexed by the last four outcomes.

A branch inside a loop produces one of the repeating sequences below forever (0 = not taken, 1 = taken).

More than one of these is predicted essentially perfectly after warm-up. Which are?