login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209672 a(n) = count of monomials, of degrees k=1 to n, in the Schur symmetric polynomials s(mu,k) summed over all partitions mu of n. 2

%I #14 May 31 2012 11:55:43

%S 1,5,26,165,1093,8203,64516,550766,4911215,46480657,457372449,

%T 4714813700,50312993309,557792410015,6377533006104,75321602836350,

%U 914532538185703,11422271100356431,146273502952981364,1920759273853147991,25802956138975439144,354546559878617075950

%N a(n) = count of monomials, of degrees k=1 to n, in the Schur symmetric polynomials s(mu,k) summed over all partitions mu of n.

%C Row sums of triangle A191714.

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Symmetric_polynomials">Symmetric Polynomials</a>

%t (* see A191714 *)

%t Tr /@ Table[Tr[stanley[#, k] & /@ Partitions[n]], {n, 10}, {k, n}]

%Y Cf. A209664-A209673.

%K nonn

%O 1,2

%A _Wouter Meeussen_, Mar 11 2012

%E a(11)-a(22) from _Alois P. Heinz_, Mar 11 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 17:51 EDT 2024. Contains 371962 sequences. (Running on oeis4.)