I think the idea is roughly this: each packing pattern is represented by an infinite string over the alphabet {a,b,c} that has no doubled letters. And there is an uncountable infinity of such strings – continuum many – because these strings are in one-one correspondence with infinite binary strings: there are two possibilities for each letter, because it can’t be the same as its predecessor but it can be either of the other two.