Well I've always liked the idea of having a sequence and finding an analytic continuation such that it returns at integer values. Recently I have found a method of continuum summing http://math.eretrandre.org/tetrationforu...hp?tid=801

This is one of the exploits we have.

We will be using two theorems, my continuum sum theorem and a result thanks to Grunwald and Letnikov.

Which reduces to the natural derivative and integral for integer values of s

We take our sequence and create an auxillary function

We are clear that

And therefore if we create the following function:

We have, thanks to my continuum sum theorem:

Therefore the function:

and interpolates the sequence

And even more beautifully:

and so we have also a continuum sum from phi.

This is a nifty little way of creating interpolation functions. Thought it was neat. Allows us to interpolate something like the prime number sequence and get an entire function that returns prime numbers at integer values. this is because the primenumber sequence doesn't grow too fast and so our auxillary function is entire.

This is one of the exploits we have.

We will be using two theorems, my continuum sum theorem and a result thanks to Grunwald and Letnikov.

Which reduces to the natural derivative and integral for integer values of s

We take our sequence and create an auxillary function

We are clear that

And therefore if we create the following function:

We have, thanks to my continuum sum theorem:

Therefore the function:

and interpolates the sequence

And even more beautifully:

and so we have also a continuum sum from phi.

This is a nifty little way of creating interpolation functions. Thought it was neat. Allows us to interpolate something like the prime number sequence and get an entire function that returns prime numbers at integer values. this is because the primenumber sequence doesn't grow too fast and so our auxillary function is entire.