[seqfan] Re: 4-ary words of length 2n

[David Scambler]

I found these identities on-line at

H. W. Gould, ed. J. Quaintance, www.math.wvu.edu/~gould/Vol.4.PDF

A045952 (7.5) p. 34.
A055787 (7.6) p. 35.

dave



On Aug 13 2012, David Scambler wrote:

>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
>