|
Search: id:A052618
|
|
|
| A052618 |
|
A simple regular expression in a labeled universe. |
|
+0
3
|
|
| 1, 2, 8, 36, 216, 1440, 11520, 100800, 1008000, 10886400, 130636800, 1676505600, 23471078400, 348713164800, 5579410636800, 94152554496000, 1694745980928000, 32011868528640000, 640237370572800000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Permanent of the n X n (0, 1)-matrix with (i, j)-th entry equal to 0 iff (i=1, j=n), (i=2, j=1), (i=3, j=n), (i=4, j=1), ... - Simone Severini (ss54(AT)york.ac.uk), Oct 17 2004
Contribution from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 14 2008: (Start)
a(n) is the number of runs of odd entries in all permutations of {1,2,...,n+1}. Example: a(2)=8 because in the permutations 123,132,213,231,312 and 321 we have a total of 2+1+1+1+1+2 runs of odd entries.
a(n)=Sum(k*A152666(n+1,k),k>=1). (End)
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 563
|
|
FORMULA
|
E.g.f.: -1/(-1+x)^2/(-1+x^2)
Recurrence: {a(0)=1, a(1)=2, (-n^2-5*n-4)*a(n)+a(n+2)-2*a(n+1)}
(1/8*(-1)^(-n)+1/4*n^2+n+7/8)*n!
a(n)=n!floor((n+2)/2)*ceil((n+2)/2) [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 14 2008]
|
|
MAPLE
|
spec := [S, {S=Prod(Sequence(Z), Sequence(Z), Sequence(Prod(Z, Z)))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
a := proc (n) options operator, arrow: factorial(n)*floor((1/2)*n+1)*ceil((1/2)*n+1) end proc; seq(a(n), n = 0 .. 20); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 14 2008]
|
|
CROSSREFS
|
A152666 [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 14 2008]
Sequence in context: A129044 A052582 A020021 this_sequence A055142 A046814 A007857
Adjacent sequences: A052615 A052616 A052617 this_sequence A052619 A052620 A052621
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
