|
| |
|
|
A052611
|
|
E.g.f. 1/(1-2x-2x^2).
|
|
1
| |
|
|
1, 2, 12, 96, 1056, 14400, 236160, 4515840, 98703360, 2426941440, 66305433600, 1992646656000, 65328154214400, 2320237766246400, 88746105588940800, 3636883029491712000, 158978387626426368000, 7383729547341987840000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 556
|
|
|
FORMULA
| E.g.f.: -1/(-1+2*x+2*x^2)
Recurrence: {a(0)=1, a(1)=2, (-2*n^2-6*n-4)*a(n)+(-4-2*n)*a(n+1)+a(n+2)=0}
Sum(1/6*(1+2*_alpha)*_alpha^(-1-n), _alpha=RootOf(-1+2*_Z+2*_Z^2))*n!
a(n) = n!*A002605(n+1). - R. J. Mathar, Nov 27 2011
|
|
|
MAPLE
| spec := [S, {S=Sequence(Union(Z, Z, Prod(Z, Union(Z, Z))))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
|
CROSSREFS
| Equals 2^n * A080599(n).
Sequence in context: A052564 A193425 A206855 * A059864 A095338 A012548
Adjacent sequences: A052608 A052609 A052610 * A052612 A052613 A052614
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
| |
|
|
