|
| |
|
|
A052733
|
|
A simple context-free grammar in a labeled universe.
|
|
0
| |
|
|
0, 0, 0, 6, 24, 240, 3600, 70560, 1693440, 47900160, 1556755200, 57081024000, 2328905779200, 104589041356800, 5124863026483200, 272011960636416000, 15543540607795200000, 951264685197066240000, 62070020709108572160000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 689
|
|
|
FORMULA
| E.g.f.: x^2*(1/2-1/2*(1-4*x)^(1/2))
Recurrence: {a(1)=0, a(2)=0, a(3)=6, a(4)=24, (-4*n^2+6*n+10)*a(n)+(n-1)*a(n+1)}
{a(1)=0, a(n+4)=0}
|
|
|
MAPLE
| spec := [S, {B=Union(Z, C), C=Prod(B, B), S=Prod(B, Z, Z)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
|
PROG
| (Mupad) combinat::catalan(n)*(n+3)! $ n = 0..15; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 15 2007
|
|
|
CROSSREFS
| Sequence in context: A112675 A052583 A052671 * A010567 A097171 A152886
Adjacent sequences: A052730 A052731 A052732 * A052734 A052735 A052736
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
| |
|
|
