cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A296624 a(n) is the total multiplicity of all products of Schur functions s(lambda)*s(mu) with partition lambda >= mu and size(lambda) + size(mu)= n.

Original entry on oeis.org

1, 1, 4, 7, 20, 37, 90, 171, 378, 721, 1500, 2843, 5682, 10661, 20674
Offset: 0

Views

Author

Wouter Meeussen, Dec 17 2017

Keywords

Comments

The condition lambda >= mu restricts the results to the lower triangular part of the matrix formed by products of all pairs of partitions.
'Multiplicity' signifies that terms like k*s(nu) count as k terms.

Examples

			For n=3 we have
s(3)*s(0) = s(3); s(2,1)*s(0) = s(2,1); s(1,1,1)*s(0) = s(1,1,1)
s(2)*s(1) = s(3) + s(2,1) and
s(1,1)*s(1) = s(2,1) + s(1,1,1)
for a total of 3+2+2 = 7 terms.
		

Crossrefs

Programs

  • Mathematica
    Tr/@ Table[Sum[
      Length[LRRule[\[Lambda], \[Mu]]], {\[Lambda],
       Partitions[n - i]}, {\[Mu],
       If[2 i === n, Join[{\[Lambda]}, lesspartitions[\[Lambda]]],
        Partitions[i]]}], {n, 14}, {i, 0, Floor[(n)/2]}]; (* Uses functions defined in the 'Toolbox for symmetric functions', see Links. *)

A296625 a(n) is the total multiplicity of all products of Schur functions s(lambda)*s(lambda) with lambda a partition of n.

Original entry on oeis.org

1, 2, 6, 16, 42, 106, 268, 660, 1618, 3922, 9438, 22540, 53528, 126358
Offset: 0

Views

Author

Wouter Meeussen, Dec 17 2017

Keywords

Comments

Diagonal of the matrix formed by products of all pairs of partitions.
Conjecture: a(n) is the number of domino tilings of diagrams of integer partitions of 2n. - Gus Wiseman, Feb 25 2018
The above conjecture is not true, see A304662. - Alois P. Heinz, May 22 2018

Examples

			for n=2,
s(2)*s(2) = s(4) + s(3,1) + s(2,2) and
s(1,1) * s(1,1) = s(2,2) + s(2,1,1) + s(1,1,1,1)
for 6 terms in total.
		

Crossrefs

Programs

  • Mathematica
    Table[Sum[Length[LRRule[\[Lambda], \[Lambda]]], {\[Lambda], Partitions[n]}], {n, 0, 7}];
    (* Uses the Mathematica toolbox for Symmetric Functions from A296624. *)

Formula

a(n) = A304662(n) for n < 7. - Alois P. Heinz, May 22 2018

Extensions

a(13)-a(14) from Wouter Meeussen, Nov 22 2018
Showing 1-2 of 2 results.