|
Search: id:A052536
|
|
|
| A052536 |
|
Number of compositions of n when parts 1 and 2 are of two kinds. |
|
+0
3
|
|
| 1, 2, 6, 17, 49, 141, 406, 1169, 3366, 9692, 27907, 80355, 231373, 666212, 1918281, 5523470, 15904198, 45794313, 131859469, 379674209, 1093228314, 3147825473, 9063802210, 26098178316, 75146709475, 216376326215, 623030800329
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 467
|
|
FORMULA
|
G.f.: -(-1+x)/(1-3*x+x^3)
Sum(-1/9*(-2+_alpha^2-_alpha)*_alpha^(-1-n), _alpha=RootOf(1-3*_Z+_Z^3))
a(0)=1, a(1)=2, a(2)=6, a(n)=3a(n-1)-a(n-3) for n>=3. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 10 2005
a(n) = left term in M^n * [1 0 0], where M = the 3X3 matrix [2 1 1 / 1 1 0 / 1 0 0]. Right term in M^n *[1 0 0] = a(n-1); middle term = A076264(n-1). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 05 2005
|
|
EXAMPLE
|
a(2)=6 because we have (2),(2'),(1,1),(1,1'),(1',1) and (1',1').
|
|
MAPLE
|
spec := [S, {S=Sequence(Union(Z, Prod(Z, Union(Z, Sequence(Z)))))}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Row sums of A105478.
Cf. A105478.
Cf. A076264.
Sequence in context: A077936 A077983 A036365 this_sequence A122100 A122099 A026165
Adjacent sequences: A052533 A052534 A052535 this_sequence A052537 A052538 A052539
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 06 2000
Edited by Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 10 2005
More terms from Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 05 2005
|
|
|
Search completed in 0.002 seconds
|
