A228125 -id:A228125 - cp's OEIS frontend

A296188 Number of normal semistandard Young tableaux whose shape is the integer partition with Heinz number n.

1, 1, 2, 1, 4, 4, 8, 1, 6, 12, 16, 6, 32, 32, 28, 1, 64, 16, 128, 24, 96, 80, 256, 8, 44, 192, 22, 80, 512, 96, 1024, 1, 288, 448, 224, 30, 2048, 1024, 800, 40, 4096, 400, 8192, 240, 168, 2304, 16384, 10, 360, 204, 2112, 672, 32768, 68, 832, 160, 5376, 5120

Offset: 1

Gus Wiseman, Feb 14 2018

nonn

A tableau is normal if its entries span an initial interval of positive integers. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The a(9) = 6 tableaux:
1 3   1 2   1 2   1 2   1 1   1 1
2 4   3 4   3 3   2 3   2 3   2 2

Richard P. Stanley, Enumerative Combinatorics Volume 2, Cambridge University Press, 1999, Chapter 7.10.

FindStat - Combinatorial Statistic Finder, Semistandard Young tableaux

Cf. A000085, A001222, A056239, A063834, A112798, A122111, A138178, A153452, A191714, A210391, A228125, A296150, A296560, A296561, A299202, A299966, A300056, A300121.

conj[y_List]:=If[Length[y]===0,y,Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
conj[n_Integer]:=Times@@Prime/@conj[If[n===1,{},Join@@Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]];
ssyt[n_]:=If[n===1,1,Sum[ssyt[n/q*Times@@Cases[FactorInteger[q],{p_,k_}:>If[p===2,1,NextPrime[p,-1]^k]]],{q,Rest[Divisors[n]]}]];
Table[ssyt[conj[n]],{n,50}]

Let b(n) = Sum_{d|n, d>1} b(n * d' / d) where if d = Product_i prime(s_i)^m(i) then d' = Product_i prime(s_i - 1)^m(i) and prime(0) = 1. Then a(n) = b(conj(n)) where conj = A122111.

A003293 Number of planar partitions of n decreasing across rows.

Original entry on oeis.org

1, 1, 2, 4, 7, 12, 21, 34, 56, 90, 143, 223, 348, 532, 811, 1224, 1834, 2725, 4031, 5914, 8638, 12540, 18116, 26035, 37262, 53070, 75292, 106377, 149738, 209980, 293473, 408734, 567484, 785409, 1083817, 1491247, 2046233, 2800125, 3821959, 5203515

Offset: 0

N. J. A. Sloane

Also number of planar partitions monotonically decreasing down antidiagonals (i.e., with b(n,k) <= b(n-1,k+1)). Transpose (to get planar partitions decreasing down columns), then take the conjugate of each row. - Franklin T. Adams-Watters, May 15 2006
Also number of partitions into one kind of 1's and 2's, two kinds of 3's and 4's, three kinds of 5's and 6's, etc. - Joerg Arndt, May 01 2013
Also count of semistandard Young tableaux with sum of entries equal to n (row sums of A228125). - Wouter Meeussen, Aug 11 2013

			From _Gus Wiseman_, Jan 17 2019: (Start)
The a(6) = 21 plane partitions with strictly decreasing columns (the count is the same as for strictly decreasing rows):
  6   51   42   411   33   321   3111   222   2211   21111   111111
.
  5   4   41   31   32   311   22   221   2111
  1   2   1    2    1    1     11   1     1
.
  3
  2
  1
(End)

D. M. Bressoud, Proofs and Confirmations, Camb. Univ. Press, 1999; p. 133.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..10000 (first 1001 terms from Nathaniel Johnston)
M. S. Cheema and W. E. Conway, Numerical investigation of certain asymptotic results in the theory of partitions, Math. Comp., 26 (1972), 999-1005.
Wenjie Fang, Hsien-Kuei Hwang, and Mihyun Kang, Phase transitions from exp(n^(1/2)) to exp(n^(2/3)) in the asymptotics of banded plane partitions, arXiv:2004.08901 [math.CO], 2020.
B. Gordon and L. Houten, Notes on Plane Partitions I, J. of Comb. Theory, 4 (1968), 72-80.
B. Gordon and L. Houten, Notes on Plane Partitions II, J. of Comb. Theory, 4 (1968), 81-99.
Basil Gordon and Lorne Houten, Notes on plane partitions III (first page is available), Duke Math. J. Volume 36, Number 4 (1969), 801-824.
B. Gordon and L. Houten, Notes on Plane Partitions V, Journal of Combinatorial Theory, vol. 11, issue 2, 1971, pp. 157-168.
B. Gordon and L. Houten, Notes on Plane Partitions VI, Discrete Mathematics, vol. 26, issue 1, 1979, pp. 41-45.
Vaclav Kotesovec, Graph - asymptotic ratio for 10000 terms.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], 2015-2016.
Richard P. Stanley, Theory and Applications of Plane Partitions: Part 2, Studies in Appl. Math., 1 (1971), 259-279.
Richard P. Stanley, Theory and Application of Plane Partitions. Part 2, Studies in Appl. Math., 1 (1971), 259-279.

Cf. A005308, A005986.

Cf. A000085, A000219, A053529, A138178, A323432, A323436.

with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d,j; if n=0 then 1 else add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: a:=etr(n-> `if`(modp(n,2)=0,n,n+1)/2): seq(a(n), n=0..45);  # Alois P. Heinz, Sep 08 2008

CoefficientList[Series[Product[(1-x^k)^(-Ceiling[k/2]), {k, 1, 40}], {x, 0, 40}], x][[1 ;; 40]] (* Jean-François Alcover, Apr 18 2011, after Michael Somos *)
nmax=50; CoefficientList[Series[Product[1/(1-x^k)^((2*k+1-(-1)^k)/4),{k,1,nmax}],{x,0,nmax}],x] (* Vaclav Kotesovec, Feb 28 2015 *)
nmax = 50; CoefficientList[Series[Product[1/((1-x^(2*k-1))*(1-x^(2*k)))^k, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Oct 02 2015 *)

{a(n)=if(n<0, 0, polcoeff( prod(k=1, n, (1-x^k+x*O(x^n))^-ceil(k/2)), n))} /* Michael Somos, Sep 19 2006 */

G.f.: Product_(1 - x^k)^{-c(k)}, c(k) = 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, ....
Euler transform of A110654. - Michael Somos, Sep 19 2006
a(n) ~ 2^(-3/4) * (3*Pi*Zeta(3))^(-1/2) * (n/Zeta(3))^(-49/72) * exp(3/2*Zeta(3) * (n/Zeta(3))^(2/3) + Pi^2*(n/Zeta(3))^(1/3)/24 - Pi^4/(3456*Zeta(3)) + Zeta'(-1)/2) [Basil Gordon and Lorne Houten, 1969]. - Vaclav Kotesovec, Feb 28 2015

More terms from James Sellers, Feb 06 2000

Additional comments from Michael Somos, May 19 2000

A228128 T(n,m) = semistandard Young tableau families, headed by a father SSYT with shape a partition of k, containing daughter SSYT of shape equal to once-trimmed father's shape, so that union of families equals all SSYT with sum of entries n.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 3, 3, 1, 1, 0, 1, 3, 4, 3, 1, 1, 0, 1, 4, 7, 5, 3, 1, 1, 0, 1, 5, 8, 9, 6, 3, 1, 1, 0, 1, 5, 13, 13, 10, 6, 3, 1, 1, 0, 1, 6, 14, 20, 17, 11, 6, 3, 1, 1, 0, 1, 7, 20, 27, 28, 19, 12, 6, 3, 1, 1, 0, 1, 7, 22, 38, 40, 33, 20, 12, 6, 3, 1, 1, 0, 1, 8, 29, 49, 60, 51, 37, 21, 12, 6, 3, 1, 1, 0, 1, 9, 31, 65, 85, 79, 59, 39, 22, 12, 6, 3, 1, 1

Offset: 1

Wouter Meeussen, Aug 11 2013

Row sums are A228129.

Reverse of rows seem to converge to first differences of A005986.

			T(6,3) = 3 since the 7 tableaux in the family contain 3 father tableaux:
11  ,  13  ,  1
4      2      2
              3
see 2nd link, "content 6".

N. Dragon, R. Stanley, Semi-Standard Young Diagrams and families;
N. Dragon, résumé

Cf. A228125, A228128, A228129.

(* hooklength: see A228125 *);
Table[Tr[(SeriesCoefficient[q^(#1 . Range[Length[#1]])/Times @@ (1-q^#1 &) /@ Flatten[hooklength[#1]],{q,0,w}]& ) /@ Partitions[n]],{w,24},{n,w}]

A296560 Number of normal semistandard Young tableaux whose shape is the conjugate of the integer partition with Heinz number n.

Original entry on oeis.org

1, 1, 1, 2, 1, 4, 1, 4, 6, 6, 1, 12, 1, 8, 16, 8, 1, 28, 1, 24, 30, 10, 1, 32, 22, 12, 44, 40, 1, 96, 1, 16, 48, 14, 68, 96, 1, 16, 70, 80, 1, 220, 1, 60, 204, 18, 1, 80, 90, 168, 96, 84, 1, 224, 146, 160, 126, 20, 1, 400, 1, 22, 584, 32, 264, 416, 1, 112, 160

Offset: 1

Gus Wiseman, Feb 15 2018

nonn

A tableau is normal if its entries span an initial interval of positive integers. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

Cf. A000085, A001222, A056239, A063834, A112798, A122111, A138178, A153452, A191714, A210391, A228125, A296150, A296188, A299202.

a[n_]:=If[n===1,1,Sum[a[n/q*Times@@Cases[FactorInteger[q],{p_,k_}:>If[p===2,1,NextPrime[p,-1]^k]]],{q,Rest[Divisors[n]]}]];
Array[a,100]

A228129 a(n) = number of semistandard Young tableau families, headed by a father SSYT, containing daughter SSYT of shape equal to once-trimmed father's shape, so that union of families equals all SSYT with sum of entries n.

Original entry on oeis.org

1, 1, 2, 3, 5, 9, 13, 22, 34, 53, 80, 125, 184, 279, 413, 610, 891, 1306, 1883, 2724, 3902, 5576, 7919, 11227, 15808, 22222, 31085, 43361, 60242, 83493, 115261, 158750, 217925, 298408, 407430, 554986

Offset: 1

Wouter Meeussen, Aug 11 2013

nonn

Row sums of A228128.

N. Dragon, R. Stanley, Semi-Standard Young Diagrams and families;

Cf. A228128, A228125.

(* hooklength: see A228125 *);
Tr/@Table[Tr[(SeriesCoefficient[q^(#1 . Range[Length[#1]])/Times @@ (1-q^#1 &) /@ Flatten[hooklength[#1]], {q, 0, w}]& ) /@ Partitions[n]], {w, 24}, {n, w}]

cp's OEIS Frontend

A296188 Number of normal semistandard Young tableaux whose shape is the integer partition with Heinz number n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A003293 Number of planar partitions of n decreasing across rows.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A228128 T(n,m) = semistandard Young tableau families, headed by a father SSYT with shape a partition of k, containing daughter SSYT of shape equal to once-trimmed father's shape, so that union of families equals all SSYT with sum of entries n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A296560 Number of normal semistandard Young tableaux whose shape is the conjugate of the integer partition with Heinz number n.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A228129 a(n) = number of semistandard Young tableau families, headed by a father SSYT, containing daughter SSYT of shape equal to once-trimmed father's shape, so that union of families equals all SSYT with sum of entries n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica