|
| |
|
|
A052505
|
|
Number of labeled 3-constrained functional graphs.
|
|
0
| | |
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 38
|
|
|
FORMULA
| E.g.f.: -2/(-2+x*RootOf(-6*_Z+6*x+x*_Z^3)^2)
Recurrence: {a(1)=0, (-9*n^4-54*n^3-117*n^2-108*n-36)*a(n)+(8*n+12)*a(n+3), a(2)=0, a(4)=0, a(3)=3, a(5)=0}
|
|
|
MAPLE
| spec := [S, {g=Union(Z, Prod(Z, Set(g, card=3))), S=Set(Cycle(Prod(Z, Set(g, card=2))))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
|
CROSSREFS
| Sequence in context: A119059 A119049 A119067 * A071525 A157583 A085319
Adjacent sequences: A052502 A052503 A052504 * A052506 A052507 A052508
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
| |
|
|
