|
Search: id:A052566
|
|
|
| A052566 |
|
A simple regular expression in a labeled universe. |
|
+0
2
|
|
| 2, 1, 4, 6, 48, 120, 1440, 5040, 80640, 362880, 7257600, 39916800, 958003200, 6227020800, 174356582400, 1307674368000, 41845579776000, 355687428096000, 12804747411456000, 121645100408832000
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 508
|
|
FORMULA
|
Recurrence: {a(1)=1, a(0)=2, (-2-n^2-3*n)*a(n)+a(n+2)}
Sum(1/2*(1+2*_alpha)*_alpha^(-1-n), _alpha=RootOf(-1+_Z^2))*n!
E.g.f.: (x+2)/(1-x^2).
2n! if n is even, n! if odd.
|
|
MAPLE
|
spec := [S, {S=Union(Sequence(Z), Sequence(Prod(Z, Z)))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
a:=n->n!+sum((-1)^k*n!, k=0..n): seq(a(n), n=0..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 25 2008
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, n!*polcoeff((x+2)/(1-x^2)+x*O(x^n), n))
|
|
CROSSREFS
|
Sequence in context: A034424 A095012 A019142 this_sequence A071948 A121722 A059579
Adjacent sequences: A052563 A052564 A052565 this_sequence A052567 A052568 A052569
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
