|
Search: id:A052555
|
|
|
| A052555 |
|
A simple regular expression in a labeled universe. |
|
+0 1
|
|
| 1, 2, 10, 72, 696, 8400, 121680, 2056320, 39715200, 862928640, 20832940800, 553246848000, 16027872537600, 503031194265600, 17001946241280000, 615694938034176000, 23782705115000832000, 976080997055324160000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 496
|
|
FORMULA
|
E.g.f.: -1/(-1+2*x+x^2)
Recurrence: {a(0)=1, a(1)=2, (-2-n^2-3*n)*a(n)+(-4-2*n)*a(n+1)+a(n+2)}
Sum(1/4*(1+_alpha)*_alpha^(-1-n), _alpha=RootOf(-1+2*_Z+_Z^2))*n!
|
|
MAPLE
|
spec := [S, {S=Sequence(Union(Z, Z, Prod(Z, Z)))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
with(combstruct):ZL:=[T, {T=Union(Z, Prod(Epsilon, Z, T), Prod(T, Z, Epsilon), Prod(T, Z, Z))}, labeled]:seq(count(ZL, size=i)/i, i=1..18); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 16 2007
|
|
CROSSREFS
|
Sequence in context: A118752 A060842 A111554 this_sequence A084844 A088189 A001395
Adjacent sequences: A052552 A052553 A052554 this_sequence A052556 A052557 A052558
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|