|
Search: id:A052719
|
|
|
| A052719 |
|
A simple context-free grammar in a labeled universe. |
|
+0
1
|
|
| 0, 0, 0, 6, 72, 1080, 20160, 453600, 11975040, 363242880, 12454041600, 476367091200, 20113277184000, 929233405900800, 46630621823385600, 2525825348766720000, 146886458743664640000, 9127944221927731200000
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 675
|
|
FORMULA
|
E.g.f.: (1/2-x-1/2*(1-4*x)^(1/2))*(1/2-1/2*(1-4*x)^(1/2))
Recurrence: {a(1)=0, a(2)=0, a(3)=6, (-2*n-6+4*n^2)*a(n)+(-2-5*n)*a(n+1)+a(n+2)}
|
|
MAPLE
|
spec := [S, {B=Union(Z, C), C=Prod(B, B), S=Prod(B, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A067419 A113331 A052678 this_sequence A063965 A047058 A001763
Adjacent sequences: A052716 A052717 A052718 this_sequence A052720 A052721 A052722
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
