|
Search: id:A062200
|
|
|
| A062200 |
|
Number of compositions of n such that two adjacent parts are not equal modulo 2. |
|
+0
6
|
|
| 1, 1, 1, 3, 2, 6, 6, 11, 16, 22, 37, 49, 80, 113, 172, 257, 377, 573, 839, 1266, 1874, 2798, 4175, 6204, 9274, 13785, 20577, 30640, 45665, 68072, 101393, 151169, 225193, 335659, 500162, 745342, 1110790, 1655187, 2466760, 3675822
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Also (0,1)-strings such that all maximal blocks of 1's have even length and all maximal blocks of 0's have odd length.
|
|
REFERENCES
|
I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983,(Problems 2.4.3, 2.4.13).
|
|
FORMULA
|
a(n)= Sum_{j=0..n+1} binomial(n-j+1, 3*j-n+1). a(n) = 2*a(n-2)+a(n-3)-a(n-4).
G.f.: -(x^2-x-1)/(x^4-x^3-2*x^2+1). More generally, g.f. for the number of compositions of n such that two adjacent parts are not equal modulo p is 1/(1-Sum_{i=1..p} x^i/(1+x^i-x^p)).
|
|
CROSSREFS
|
Cf. A003242, A062201-A062203.
Sequence in context: A098071 A023360 A096375 this_sequence A114208 A014686 A053090
Adjacent sequences: A062197 A062198 A062199 this_sequence A062201 A062202 A062203
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 13 2001
|
|
|
Search completed in 0.002 seconds
|
