Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115131
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115131 Waring numbers for power sums functions in terms of elementary symmetric functions. +0
1
1, -2, 1, 3, -3, 1, -4, 4, 2, -4, 1, 5, -5, -5, 5, 5, -5, 1, -6, 6, 6, 3, -6, -12, -2, 6, 9, -6, 1, 7, -7, -7, -7, 7, 14, 7, 7, -7, -21, -7, 7, 14, -7, 1, -8, 8, 8, 8, 4, -8, -16, -16, -8, -8, 8, 24, 12, 24, 2, -8, -32, -16, 8, 20, -8, 1, 9, -9, -9, -9, -9, 9, 18, 18, 9, 9, 18, 3, -9, -27, -27, -27, -27, -9, 9, 36, 18, 54, 9, -9, -45, -30, 9 (list; graph; listen)
OFFSET

1,2

COMMENT

N*t^{(N)}_n(sigma_1,...sigma_N):=sum((x_k)^n,k=1..N) with the elementary symmetric function sigma_k (superscript (N) omitted) in terms of the indeterminates x_1,...,x_N, is an N-variable generalization of Chebyshev's T_n((sigma_1)/2) = t^{(N=2)}_n(sigma_1,sigma_2=1) polynomials. In general T_n^{(N)}(sigma_1,...,sigma_{N-1}):= t^{(N)}_n(sigma_1,...,sigma_{N-1},sigma_N:=1). If n>N one puts sigma_{N+1} = 0,...,sigma_n = 0.

The sequence of row lengths of this array is A000041(n) (partition numbers).

This array uses in row number n partitions of n listed in the Abramowitz-Stegun order (compare with the M_0, M_1, M_2 and M_3 numbers given in |A111786|, A036038, A036039 and A036040, resp.).

Row sums give (-1)^(n-1). Unsigned row sums give A000225(n)= 2^n - 1.

REFERENCES

P. A. MacMahon, Combinatory Analysis, 2 vols., Chelsea, NY, 1960, see p. 5 (with a_k->sigma_k).

R. Lidl, Ch. Wells, 'Chebyshev polynomials in several variables', J. reine u. angew. Math. 255 (1972)104-111.

R. Lidl, `Tschebyscheffpolynome in mehreren Variablen`, J. reine u. angew. Math. 273 (1975)178-198.

W. Lang: 'On Sums of Powers of Zeros of Polynomials', J. of Comp. and Applied Math. 89 (1998) 237-256; Theorem 1.

LINKS

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].

P. A. MacMahon, Combinatory analysis.

W. Lang: First 10 rows.

FORMULA

a(n, k)= (n/m(n, k))*|A111786(n, k)| for the k-th partition of n with m(n, k) parts in the Abramowitz-Stegun order. n>=1, k=1, ..., p(n):=A000041(n).

Explicitly: a(n, k)= n*(m(n, k)-1)!/product(e(k, j)!, j=1..n ), where m(n, k):= sum(e(k, j), j=1..n), with [1^e(k, 1), 2^e(k, 2), ..., n^e(k, n)] the k-th partition of n in the mentioned order. For m(n, k) see A036043.

EXAMPLE

[1];[ -2,1];[3,-3,1];[ -4,4,2,-4,1];[5,-5,-5,5,5,-5,1];...

n=4: N*t^{(N)}_4= -4*(sigma_4)^1 + 4*(sigma_1)*(sigma_3) +

2*(sigma_2)^2 -4*(sigma_1)^2*(sigma_2) + 1*(sigma_1)^4 (for 2<= N < 4 one

puts sigma_{N+1}=0= ... =sigma_4=0. This becomes sum((x_k)^4,k=1..N) if the

sigma functions are written in terms of the x_1,...,x_N variables. E.g. N=2:

2*(x_1*x_2)^2 -4*(x_1 + x_2)^2*(x_1*x_2) + 1*(x_1 + x_2)^4 = (x_1)^4 +

(x_2)^4.

CROSSREFS

Sequence in context: A049834 A134625 A054531 this_sequence A117895 A128139 A104732

Adjacent sequences: A115128 A115129 A115130 this_sequence A115132 A115133 A115134

KEYWORD

sign,easy,tabf

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Jan 13 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research