|
Search: id:A052742
|
|
|
| A052742 |
|
A simple context-free grammar in a labeled universe. |
|
+0
1
|
|
| 0, 0, 2, 12, 144, 2640, 64800, 1985760, 72817920, 3105527040, 150907276800, 8226772646400, 497068582348800, 32962398345676800, 2379770152465305600, 185792734381782528000, 15595576381312671744000
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 698
|
|
FORMULA
|
E.g.f.: (1/2-1/2*x-1/2*(1-6*x+x^2)^(1/2))*x
Recurrence: {a(1)=0, a(2)=2, a(3)=12, (-4*n+n^2-4+n^3)*a(n)+(-6*n^2+6-9*n)*a(n+1)+(n+1)*a(n+2)}
|
|
MAPLE
|
spec := [S, {B=Prod(C, C), C=Union(B, S, Z), S=Prod(Z, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A009747 A067601 A052740 this_sequence A035049 A010790 A086928
Adjacent sequences: A052739 A052740 A052741 this_sequence A052743 A052744 A052745
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
