Abstract
We establish several recurrence relations and an explicit formula for , the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In particular, we show that the sequence is the shuffle of the ceilings of two linear functions of n.