I am curious about the below function, as it allows one to build a perfect ordering of the prime numbers through a method that I developed, that is, there is a function $f(n)$ such that $f(n)$ is the n-th prime.
Let’s call this new zeta function $\zeta^*$:
$$\zeta^*(s)=\sum_{k=1}^{\infty}\frac{p_k}{k^s}$$
Where $p_k$ is obviously the k-th prime number.
Now the questions that naturally arise are:
1) what is the smallest positive $s>1$ for which this function converges?
2) what are the values of this function at the positive integers?
Any other information about this function helps as well.
By the prime number theorem, $\pi(x) \sim x / \ln x$ and $p_k \sim k \ln k$, so by Cauchy's root test:
$\begin{align*} \lim_{k \to \infty} \sqrt[k]{p_k / k^s} &= \lim_{k \to \infty} \sqrt[k]{k \ln k / k^s} \\ &= \lim_{k \to \infty} \sqrt[k]{k^{1 - s} \ln k} \ \end{align*}$
To simplify the root, take logarithms:
$\begin{align*} \lim_{k \to \infty} \frac{(1 - s) \ln k + \ln \ln k}{k} \end{align*}$
This limit is zero for all $s$, thus this test is inconclusive (the original limit is 1). Thus the ratio test is also inconclusive.
Would need to check other tests, but I ran out of steam.