|
%I #39 Jan 18 2018 12:25:09
%S 3,20,420,18144,1330560,148262400,23351328000,4940103168000,
%T 1351612226764800,464463110651904000,195848611658219520000,
%U 99430833611096064000000,59828953024276660224000000,42103628541617628354969600000,34261827725741345073856512000000,31923961833867229762934538240000000
%N Ratio of (2n-1)! to number of zeros in upper part of Sylvester matrix of polynomial of degree n with all nonzero coefficients.
%C From _Anthony Hernandez_, Oct 24 2017: (Start)
%C If (n,n-1) is the two-part partition of any odd integer greater than 1 then a(n-1) is the number of permutations of shape (n,n-1). For example, the two-part partition of 11 with shape (n,n-1) is (6,5). Pictorially we can draw this as a standard Young diagram with cells populated by hook lengths:
%C (6,5) = 7 6 5 4 3 1
%C 5 4 3 2 1
%C and there are a(6-1) = a(5) = 1330560 permutations with shape (6,5). (End)
%F a(n) = (2n - 1)!/(n*(n - 1)) for n >= 2.
%p A138897:=n->(2*n - 1)!/(n*(n - 1)): seq(A138897(n), n=2..20); # _Wesley Ivan Hurt_, Nov 25 2017
%t Table[(2 n - 1)!/(n (n - 1)), {n, 2, 20}]
%o (PARI) a(n) = (2*n - 1)!/(n*(n - 1)); \\ _Michel Marcus_, Oct 28 2017
%Y Cf. A002378, A009445, A007878, A138896, A138898, A000108.
%K nonn
%O 2,1
%A _Artur Jasinski_, Apr 02 2008
%E More terms from _Michel Marcus_, Oct 28 2017
|
