|
%I #37 Sep 08 2022 08:44:59
%S 0,0,0,0,24,240,2160,20160,201600,2177280,25401600,319334400,
%T 4311014400,62270208000,958961203200,15692092416000,271996268544000,
%U 4979623993344000,96035605585920000,1946321606541312000
%N Number of pairs of sequences of cardinality at least 2.
%H Vincenzo Librandi, <a href="/A052520/b052520.txt">Table of n, a(n) for n = 0..400</a>
%H Milan Janjic, <a href="http://www.pmfbl.org/janjic/">Enumerative Formulas for Some Functions on Finite Sets</a>.
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=87">Encyclopedia of Combinatorial Structures 87</a>.
%F E.g.f.: x^4/(1-x)^2.
%F (n-3)*a(n+1) + (2+n-n^2)*a(n) = 0, with a(0) = a(1) = a(2) = a(3) = 0, a(4) = 24.
%F a(n) = (n-3)*n!, n>2.
%F a(n) = (n+1)!*(n-3)/(n+1), n>2. - _Gary Detlefs_, Oct 02 2011
%F From _Amiram Eldar_, Jan 14 2021: (Start)
%F Sum_{n>=4} 1/a(n) = 59/36 - 2*e/3 - gamma/6 + Ei(1)/6 = 59/36 - (2/3)*A001113 - (1/6)*A001620 + A091725/2.
%F Sum_{n>=4} (-1)^n/a(n) = 1/36 - 1/(3*e) + gamma/6 - Ei(-1)/6 = 1/36 - (1/3)*A068985 + (1/6)*A001620 + (1/6)*A099285. (End)
%p Pairs spec := [S,{B=Sequence(Z,2 <= card),S=Prod(B,B)},labeled]: seq(combstruct[count](spec,size=n), n=0..20);
%t Table[Sum[n!, {i,4,n}], {n, 0, 19}] (* _Zerinvary Lajos_, Jul 12 2009 *)
%t With[{nn=20},CoefficientList[Series[x^4/(x-1)^2,{x,0,nn}],x] Range[0,nn]!] (* _Harvey P. Dale_, Jun 03 2016 *)
%o (PARI) {a(n) = if(n<4, 0, (n-3)*n!)}; \\ _G. C. Greubel_, May 13 2019
%o (Magma) [n le 3 select 0 else (n-3)*Factorial(n): n in [0..20]]; // _G. C. Greubel_, May 13 2019
%o (Sage) [0,0,0,0]+[(n-3)*factorial(n) for n in (4..20)] # _G. C. Greubel_, May 13 2019
%o (GAP) Concatenation([0,0,0,0], List([4..20], n-> (n-3)*Factorial(n))) # _G. C. Greubel_, May 13 2019
%Y Cf. sequences with formula (n + k)*n! listed in A282466.
%Y Cf. A001113, A001620, A068985, A091725, A099285.
%K easy,nonn
%O 0,5
%A encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
