Those who enjoy number patterns will no doubt have had many hours of pleasure exploring the Fibonacci sequence to various moduli, and especially in recognising the regularity with which various prime factors occur in thesequence (see [1]). Gill Hatch’s question is whether the occurrence of prime factors in generalised Fibonacci sequences is similarly predictable. Generalised Fibonacci sequences (Gn), abbreviated to GF sequences, are sequences of positive integers derived from the recurrence relation tn + 2 = tn + 1 + tn. In the case of the Fibonacci sequence (Fn), the first two terms are 1 and 1.