|
Search: id:A052732
|
|
|
| A052732 |
|
A simple context-free grammar in a labeled universe. |
|
+0
1
|
|
| 0, 0, 0, 0, 24, 240, 3600, 70560, 1693440, 47900160, 1556755200, 57081024000, 2328905779200, 104589041356800, 5124863026483200, 272011960636416000, 15543540607795200000, 951264685197066240000, 62070020709108572160000
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 688
|
|
FORMULA
|
E.g.f.: (1/2-x-1/2*(1-4*x)^(1/2))*x^2
Recurrence: {a(1)=0, a(2)=0, a(3)=0, a(4)=24, (-4*n^2+6*n+10)*a(n)+(n-1)*a(n+1), a(5)=240}
{a(1)=0, a(n+5)=0}
|
|
MAPLE
|
spec := [S, {B=Union(Z, C), C=Prod(B, B), S=Prod(Z, Z, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A000536 A151720 A052652 this_sequence A086603 A000594 A022716
Adjacent sequences: A052729 A052730 A052731 this_sequence A052733 A052734 A052735
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
