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!)
A209670 a(n) = count of monomials, of degrees k=1 to n, in the elementary symmetric polynomials e(mu,k) summed over all partitions mu of n. 4

%I #16 Mar 02 2017 21:15:12

%S 1,6,48,547,7301,120315,2239803,48278809,1153934735,30834749017,

%T 900390736548,28782727026031,993911439932097,37039780178206877,

%U 1477457354215115765,62950691931099382408,2849385291187650049208,136701569959985165325989,6924379544998951633495956

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

%H Peter J. Taylor, <a href="/A209670/b209670.txt">Table of n, a(n) for n = 1..100</a>

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

%F Row sums of triangle A209669.

%t e[n_, v_] := Tr[Times @@@ Select[Subsets[Table[Subscript[x, j], {j, v}]], Length[#] == n &]]; e[par_?PartitionQ, v_] := Times @@ (e[#, v] & /@ par); Tr/@ Table[Tr[(e[#, k] & /@ Partitions[l]) /. Subscript[x, _] -> 1], {l, 10}, {k, l}]

%Y Cf. A209664-A209673.

%K nonn

%O 1,2

%A _Wouter Meeussen_, Mar 11 2012

%E More terms from _Peter J. Taylor_, Mar 02 2017

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 September 7 16:28 EDT 2024. Contains 375748 sequences. (Running on oeis4.)