|
%I #26 Nov 09 2022 00:06:51
%S 1,1,2,17,98,882,7812,78129,815474,8955650,101869508,1194964498,
%T 14374530436,176681194276,2212121332488,28145258688369,
%U 363177582488274,4745064935840178,62687665026816228,836447728509168930,11261240896657686660,152847558411986548260
%N Number of 4-tuples of standard tableau with height less than or equal to 2.
%C Number of pairs of Dyck paths of semilength n with equal midpoint. - _Alois P. Heinz_, Oct 07 2022
%H Alois P. Heinz, <a href="/A129123/b129123.txt">Table of n, a(n) for n = 0..839</a>
%H F. Bergeron, L. Favreau and D. Krob, <a href="http://dx.doi.org/10.1016/0012-365X(94)00148-C">Conjectures on the enumeration of tableaux of bounded height</a>, Discrete Math, vol. 139, no. 1-3 (1995), 463-468.
%F a(n) = Sum_{k=0..n} A120730(n,k)^4. - _Philippe Deléham_, Oct 18 2008
%F From _Vaclav Kotesovec_, Dec 16 2017: (Start)
%F Recurrence: n*(n+1)^3*(15*n^2 - 34*n + 7)*a(n) = 2*n*(90*n^5 - 309*n^4 + 147*n^3 + 124*n^2 - 135*n + 35)*a(n-1) + 4*(n-1)^2*(4*n - 5)*(4*n - 3)*(15*n^2 - 4*n - 12)*a(n-2).
%F a(n) ~ 3* 2^(4*n - 1/2) / (Pi^(3/2) * n^(7/2)). (End)
%F a(n) = A357652(n) - A355481(n). - _Alois P. Heinz_, Oct 13 2022
%F a(n) = Sum_{j=0..floor(n/2)} ((n-2*j+1)/(n-j+1))^4 * binomial(n,j)^4. - _G. C. Greubel_, Nov 08 2022
%t Table[Sum[(Binomial[n, k] - Binomial[n, k-1])^4, {k,0, Floor[n/2]}], {n,0,20}] (* _Vaclav Kotesovec_, Dec 16 2017 *)
%o (PARI) a(n)=sum(k=0, n\2, (binomial(n, k)-binomial(n, k-1))^4)
%o (Magma) [(&+[((n-2*j+1)/(n-j+1))^4*Binomial(n,j)^4: j in [0..Floor(n/2)]]): n in [0..30]]; // _G. C. Greubel_, Nov 08 2022
%o (SageMath)
%o def A129123(n): return sum(((n-2*j+1)/(n-j+1))^4*binomial(n,j)^4 for j in range((n//2)+1))
%o [A129123(n) for n in range(31)] # _G. C. Greubel_, Nov 08 2022
%Y Cf. A000108, A001405, A003161, A120730, A355481, A357652.
%Y Column k=4 of A357824.
%K nonn
%O 0,3
%A _Mike Zabrocki_, Mar 29 2007
|
