|
Search: id:A052520
|
|
|
| A052520 |
|
Number of pairs of sequences of cardinality at least 2. |
|
+0
1
|
|
| 0, 0, 0, 0, 24, 240, 2160, 20160, 201600, 2177280, 25401600, 319334400, 4311014400, 62270208000, 958961203200, 15692092416000, 271996268544000, 4979623993344000, 96035605585920000, 1946321606541312000
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
LINKS
|
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 87
|
|
FORMULA
|
E.g.f.: x^4/(-1+x)^2
Recurrence: {a(1)=0, a(0)=0, a(2)=0, a(3)=0, (n+2-n^2)*a(n)+(n-3)*a(n+1), a(4)=24}
(n-3)*n!, n>2.
|
|
MAPLE
|
Pairs spec := [S, {B=Sequence(Z, 2 <= card), S=Prod(B, B)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
MATHEMATICA
|
Table[Sum[n!, {i, 4, n}], {n, 0, 19}] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 12 2009]
|
|
CROSSREFS
|
Sequence in context: A000919 A014340 A052753 this_sequence A052724 A000536 A151720
Adjacent sequences: A052517 A052518 A052519 this_sequence A052521 A052522 A052523
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
