|
%I #26 Sep 08 2022 08:44:59
%S 0,0,0,0,0,0,720,10080,120960,1451520,18144000,239500800,3353011200,
%T 49816166400,784604620800,13076743680000,230150688768000,
%U 4268249137152000,83230858174464000,1703031405723648000
%N Number of pairs of sequences of cardinality at least 3.
%H G. C. Greubel, <a href="/A052521/b052521.txt">Table of n, a(n) for n = 0..445</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=88">Encyclopedia of Combinatorial Structures 88</a>.
%F E.g.f.: x^6/(1-x)^2.
%F (n-5)*a(n+1) + (4 + 3*n - n^2)*a(n) = 0, with a(0) = a(1) = a(2) = a(3) = a(4) = a(5) = 0, a(6) = 720.
%F a(n) = (n-5)*n!.
%F From _Amiram Eldar_, Jan 14 2021: (Start)
%F Sum_{n>=6} 1/a(n) = 5477/7200 - 17*e/60 - gamma/120 + Ei(1)/120 = 5477/7200 - (17/60)*A001113 - (1/120)*A001620 + A091725/120.
%F Sum_{n>=6} (-1)^n/a(n) = 403/7200 - 1/(6*e) + gamma/120 - Ei(-1)/120 = 403/7200 - (1/6)*A068985 + (1/120)*A001620 + (1/120)*A099285. (End)
%p spec := [S,{B=Sequence(Z,3 <= card), S=Prod(B,B)},labeled]: # Pairs spec
%p seq(combstruct[count](spec, size=n), n=0..20);
%t Table[If[n<6, 0, (n-5)*n!], {n,0,20}] (* _G. C. Greubel_, May 13 2019 *)
%o (PARI) {a(n) = if(n<6, 0, (n-5)*n!)}; \\ _G. C. Greubel_, May 13 2019
%o (Magma) [n le 5 select 0 else (n-5)*Factorial(n): n in [0..20]]; // _G. C. Greubel_, May 13 2019
%o (Sage) [0,0,0,0,0,0]+[(n-5)*factorial(n) for n in (6..20)] # _G. C. Greubel_, May 13 2019
%o (GAP) Concatenation([0,0,0,0,0,0], List([6..20], n-> (n-5)*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 nonn,easy
%O 0,7
%A encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
