|
Search: id:A052722
|
|
|
| A052722 |
|
A simple context-free grammar in a labeled universe. |
|
+0
1
|
|
| 0, 0, 0, 0, 0, 120, 3600, 100800, 3024000, 99792000, 3632428800, 145297152000, 6351561216000, 301699157760000, 15487223431680000, 854894733428736000, 50516506975334400000, 3182539939446067200000, 212985365178313728000000
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 678
|
|
FORMULA
|
E.g.f.: (-1/2+1/2*(1-4*x)^(1/2)+x)^2*(1/2-1/2*(1-4*x)^(1/2))
Recurrence: {a(1)=0, a(2)=0, a(4)=0, a(3)=0, a(5)=120, (-2*n^2+22*n+20-4*n^3)*a(n)+(19*n-14+13*n^2)*a(n+1)+(-7*n-9)*a(n+2)+a(n+3)}
|
|
MAPLE
|
spec := [S, {C=Union(B, Z), B=Prod(C, C), S=Prod(B, B, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A105943 A052721 A060490 this_sequence A139389 A000514 A055360
Adjacent sequences: A052719 A052720 A052721 this_sequence A052723 A052724 A052725
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
