cp's OEIS Frontend

A332957 Number of labeled forests with n trees and 2*n nodes without trees of order exceeding n - floor(n/4).

%I A332957 #23 Apr 11 2020 04:37:57
%S A332957 0,3,195,5145,504945,47896695,4900634739,432180333585,57753467156385,
%T A332957 8322385282168815,1297830988347128235,195029484510994774641,
%U A332957 36350420770495795788825,7233322663694914389377775,1534057832485607065840824075
%N A332957 Number of labeled forests with n trees and 2*n nodes without trees of order exceeding n - floor(n/4).
%C A332957 When n increases practically all forests do not have trees of order exceeding n - floor (n/4). See table below.
%C A332957                   n =   1      4      8      16    28     44     48      83
%C A332957 a(n)/A302112(n)*100 =  0.0%  27.3%  61.5%  85.8%  95.6%  98.8%  99.1%   99.94%
%D A332957 D. E. Knuth, The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions, Addison-Wesley, 2005, pp. 39, 47.
%F A332957 a(n) = (2*n)! * Sum_{P(2*n,n)} Product_{p=1..2*n} f(p)^c_p / (c_p! * p!^c_p), where f(n) = A000272(n) = n^(n-2), and P(2*n,n) are the partitions of 2*n with n parts, without parts exceeding n - floor(n/4):
%F A332957 c_1 + 2*c_2 + ... + (2*n)*c_(2*n) = 2n; c_1, c_2, ..., c_(2*n) >= 0.
%e A332957 E.g., a(4) = 5145. The partitions of 2*n = 8 with four parts, no parts exceeding n - floor(n/4) = 3 are [1*2 + 3*2], [1*1 + 2*2 + 3*1], and [2*4].
%e A332957 The first partition corresponds to f(1)^2*f(3)^2 / ((2!*1!^2)*(2!*3!^2)) = 1^2*3^2 / (2*2*36) = 1/16, the second corresponds to f(1)^1 * f(2)^2 * f(3)^1 / ((1!*1!^1)*(2!*2!^2)*(1!*3!^1)) = 1/16, and the last corresponds to f(2)^4 / (4!*2!^4) = 1/384. Finally 8! * (1/16 + 1/16 + 1/384)= 5145. (See formula).
%o A332957 (PARI) a(n) = { my(S=0); forpart(aa=2*n, my(D = Set(aa)); S += prod(j= 1, #D, my(p=D[j], c=#select(x-> x==p, Vec(aa))); (p^(p-2))^c / (c!* p!^c)), [1, n-n\4], [n, n]); (2*n)! * S};
%o A332957 (PARI) a(n)={my(p=sum(k=1, n-n\4, k^(k-2)*x^k/k!)); (2*n)!*polcoef( polcoef( exp(y*p + O(x*x^(2*n))), 2*n, x), n, y)} \\ _Andrew Howroyd_, Apr 10 2020
%Y A332957 Cf. A000272, A302112.
%K A332957 nonn
%O A332957 1,2
%A A332957 _Washington Bomfim_, Apr 09 2020