|
%I #24 Nov 22 2023 06:04:29
%S 0,2,16,182,2400,35310,562848,9540674,169777504,3142665968,
%T 60099912320,1181283863632,23767586624960,487947659276790,
%U 10195163202404160,216335108170636650,4653803620322450880,101343766487960918460,2231268469684932939360,49614581272087698764820
%N Number of standard Young tableaux of type (n,n,n) whose (2,1) entry is odd.
%D For definition see James and Kerber, Representation Theory of Symmetric Group, Addison-Wesley, 1981, p. 107.
%H Alois P. Heinz, <a href="/A011553/b011553.txt">Table of n, a(n) for n = 1..200</a>
%H <a href="/index/Y#Young">Index entries for sequences related to Young tableaux.</a>
%F a(n) ~ 3^(3*n+7/2) / (64*Pi*n^4). - _Vaclav Kotesovec_, Sep 06 2014
%F Conjecture D-finite with recurrence 6*(n+2)*(n+1)^2*a(n) -(n+1)*(164*n^2-179*n+51) *a(n-1) +(46*n^3-609*n^2+812*n+12) *a(n-2) +12*(3*n-4) *(2*n-5) *(3*n-5)*a(n-3)=0. - _R. J. Mathar_, Nov 22 2023
%e a(2) = 2 because the standard Young tableaux of type (2,2,2) whose (2,1) entry is odd are:
%e +---+ +---+
%e |1 2| |1 2|
%e |3 5| |3 4|
%e |4 6| |5 6|
%e +---+ +---+ - _Alois P. Heinz_, Feb 28 2012
%Y Cf. A123555.
%K nonn
%O 1,2
%A giambruno(AT)ipamat.math.unipa.it
%E Definition corrected by Amitai Regev (amitai.regev(AT)weizmann.ac.il), Nov 15 2006
%E More terms and offset corrected by _Alois P. Heinz_, Feb 28 2012
| 