[seqfan] 4-ary words of length 2n
David Scambler
dscambler at bmm.com
Mon Aug 13 12:08:13 CEST 2012
Seqfans,
Take all 4-ary words of length 2n and split them into two subsets - those where the combined
count of 0's and 1's exceeds n and those where that is not the case.
Then these subsets are counted by A055787 and A045952 respectively.
i.e. A055787 + A045952 = 2^4n.
Not having the book from which these sequences derive I do not know whether the book
considered concrete examples such as this.
dave
https://oeis.org/A055787
https://oeis.org/A045952
More information about the SeqFan
mailing list