Thanks for that.I figure that the answer would be, how many iterations does the LFSR have to go through in order to get to the start of the next verse of the West Side Story song, which would be "Oh", or 4F68 in hex, or 0100 1111 0110 1000 in binary.
It would take you a very long time to determine that answer by hand, as it will take you more than 33,000 iterations to arrive at the correct answer (very big hint).
There are three other possibilities with mixing of upper and lower case "O"s and "H"'s.
I've found those cases you mention. Of course it depends on which starting (seed) value you choose as to the particular iteration where the anticipated text first appears.
For instance if you enter the seed 1001 1110 1101 0000 = HEX 9ED0 the next iteration gives the ASCII equivalent "Oh"
Interestingly, you can find other two letter "words" [sequences] such as "OK" or "Hi" and "Pi". Usually you seem to get the four options ignoring any upper / lower case exclusions. Finding 3 letter words [as contiguous sequences] would be an interesting if not impossible [i.e. null result] challenge. I can't find "cat" for instance.