I am writing a program that computes a Lagrange polynomial using parallel processing for data points situated at every natural number. But I can have $n$ many data points, which will potentially create a polynomial of degree $n$. Doing some math and research I found out that what I need is a general form for the $ith$ coefficient of the Elementary Symmetric Polynomial specialized to the natural numbers. I just asked a question about about a double sum inside one of the solving for one of the coefficients partial sum of $\sum^h_{i=1}\sum^i_{j=1}ij$. But I thought I would ask the whole thing here.
To give some examples the coefficients of the cubic case would be $x^3-(1+2+3)x^2+(1*2+2*3+1*3)x-1*2*3$ and the quartic case would be $x^4-(1+2+3+4)x^3+(1*2+2*3+1*3+1*4+2*4+3*4)x^2-(1*2*3+1*3*4+1*2*4+2*3*4)x-1*2*3*4$
Because the polynomials would be like $(x-3)(x-2)(x-1)$ as an example.
I spent all morning coming up with only the first three partial sums of for the coefficients.
Which are $1,\frac{n(n+1)}{2},\frac{(n-1)n(n+1)(3n+2)}{24},\frac{n^2(n+1)^2(n-1)(n-2)}{48}$. Before I embark on trying to get the next coefficient then trying to generalize from there, is there a solution (I am not an expert in what seems to be combinatoric algebra) that someone can point me too for the closed form for each of the coefficients or a proof that someone can show.
I read this but this is a little over my head meaning that I don't know if my answer is in there or not. I am computer guy, so any simplified explanation is greatly appreciated.
Any help is much appreciated! Thanks in advance!
Edit: I did more research and I am came across Vieta's formula, maybe I can use this for a closed form.
Edit 2: I found this post talking about Stirling numbers Coefficients of polynomial $(x+1)(x+2)...(x+n)$ I am wondering if I can manipulate it to my answer
