|
Search: id:A052993
|
|
|
| A052993 |
|
a(n)=a(n-1)+3a(n-2)-3a(n-3). |
|
+0
1
|
|
| 1, 1, 4, 4, 13, 13, 40, 40, 121, 121, 364, 364, 1093, 1093, 3280, 3280, 9841, 9841, 29524, 29524, 88573, 88573, 265720, 265720, 797161, 797161, 2391484, 2391484, 7174453, 7174453, 21523360, 21523360, 64570081, 64570081, 193710244
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1069
|
|
FORMULA
|
G.f.: 1/((-1+3*x^2)*(-1+x)).
Recurrence: {a(1)=1, a(0)=1, -3*a(n)-1+a(n+2)}
-1/2+Sum((1/4)*(1+3*_alpha)*_alpha^(-1-n), _alpha=RootOf(-1+3*_Z^2))
a(n)=sum{k=0..n, 3^(k/2)(1-(-1)^k)/(2sqrt(3))} - Paul Barry (pbarry(AT)wit.ie), Jul 28 2004
|
|
MAPLE
|
spec := [S, {S=Prod(Sequence(Prod(Union(Z, Z, Z), Z)), Sequence(Z))}, unlabeled ]: seq(combstruct[count ](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Cf. A062318.
Sequence in context: A038804 A088838 A127403 this_sequence A005301 A099924 A147824
Adjacent sequences: A052990 A052991 A052992 this_sequence A052994 A052995 A052996
|
|
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
|
|
|
Search completed in 0.002 seconds
|
