How many finite sequences are there such that each or , and ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There are six possible cases:
For { 2 , 2 , 2 , 2 , 2 } , there is only 1 possible sequence.
For { 1 , 1 , 2 , 2 , 2 , 2 } , there are ( 4 6 ) = 1 5 possible sequences.
For { 1 , 1 , 1 , 1 , 2 , 2 , 2 } , there are ( 3 7 ) = 3 5 possible sequences.
For { 1 , 1 , 1 , 1 , 1 , 1 , 2 , 2 } , there are ( 2 8 ) = 2 8 possible sequences.
For { 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 2 } , there are ( 1 9 ) = 9 possible sequences.
And, for { 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 } , there is only 1 possible sequence.
Thus, all in all, there are 1 + 1 5 + 3 5 + 2 8 + 9 + 1 = 8 9 possible sequences.