On Perron’s Formula and the Prime Numbers

Michael M. Anthony

Department of Engineering, Enertron Inc., Hohenwald, Tennessee, USA.

DOI: 10.4236/apm.2024.146027                

Abstract

The Riemann hypothesis is intimately connected to the counting functions for the primes. In particular, Perron’s explicit formula relates the prime counting function to fixed points of iterations of the explicit formula with particular relations involving the trivial and non-trivial roots of the Riemann Zeta function and the Primes. The aim of the paper is to demonstrate this relation at the fixed points of iterations of explicit formula, defined by functions of the form ${\lim }_{T\in {\rm N}\to \infty }{f}^T\left(z_w\right)=z_w$ ,where, $z_w$ is a real number.

Keywords

Perron, Fixed Points, Iterations, Number Theory, Riemann Hypothesis, Iterations, Invariance, Primes

1. Fixed Points of Iterations

Tetration and iterations of common functions such as the Riemann Zeta function, and the log function produce results that follow similar characteristics. For tetrations, this property of fixed points comes from the existence of infinite procedure that focus on certain the fixed points where the iterations produce the same result. A few examples will be given here, and then the Perron’s function will be examined for fixed points that infer the prime number theorem. Tetration is important due to:

a) there is a fixed point of the tetration that determines the final end point of the process, and,

b) to get from the general complex plain to the real values of a function, a tetration must go through the zeroes of the function.

Tetration also provides a link between the roots of a function and its fixed values.

Given an Abel function that satisfies $A_f\left(f\left(z\right)\right)=A_f\left(z\right)+1$ there exist another function by adding any constants ${A^{\prime }}_f\left(f\left(z\right)\right)=A_f\left(z\right)+c$ . Then, the super-logarithm is defined by ${\text{slog}}_b\left(1\right)=0$ , and the Abel function could be determined completely. If the existence and uniqueness of the analytic extension of tetration is provided by the condition of its asymptotic approach to the fixed points $z_w=0.3181315052-1.337235701i$ , $\overline{z}=0.3181315052-1.337235701i$ of $z_w=\log \left(z_w\right)$ , in the upper and lower part of the complex plain, then the inverse functions are also unique. Such a function becomes real at some point of the tetrations. In this paper, we will use ${\zeta }^{\prime }$ , ${\zeta }^{″}$ , to represent the first and second derivatives of the Zeta function $\zeta \left(s\right)$ .

Define the T^th iteration of an argument z, of the ζ-function, as the super-zeta function ${\zeta }^T\left(z\right)$ , and the T^th iteration of an argument z, of the log-function, $\log \left(z\right)$ , as the super-log function:

${\zeta }^T\left(z\right)=\underset{T\text{times}}{\underbrace{\zeta \left(\zeta \left(\zeta \left(\cdots \zeta \left(z\right)\right)\right)\right)}}\text{,}{\text{slog}}_T\left(z\right)=\underset{T\text{times}}{\underbrace{\log \left(\log \left(\log \left(\cdots \log \left(\log z\right)\right)\right)\right)}}$ (1)

Then, there exists a fixed point $z_T$ for ${\zeta }^T\left(z\right)$ given by the continuity of iterations of any argument $z=\rho +it$ , such that:

$\underset{T\to \infty }{\lim }{\zeta }^T\left(z\right)=\zeta \left(\underset{T\to \infty }{\lim }{\text{slog}}_n\left(z\right)\right)=\zeta \left(z_w\right)=-0.29590500557213955\cdots$ (2)

These constants,$z_w=0.3181315052\pm 1.337235701i$ , and $z_w-0.29590500557213955\cdots$ were discovered by the author in [1]. It is important to note that the following is true as a result of the LambertW function.

$z_w={\text{e}}^{z_w}$ (3)

Thus, given an argument $z=\rho +it$ of the ζ-function, $\zeta \left(z\right)$ , the only set of complex numbers that satisfy the fixed-point solutions, $z_w$ , are the roots of the ζ-function and the constant $z_w$ . The roots take any tetration to the zeroes and thus the reals of the functions iterated for both the Riemann Zeta function, $\zeta \left(z\right)$ and the ${\text{slog}}_T\left(z\right)$ function

It follows that there must exist fixed of Perron’s explicit formula,

$\psi \left(x\right)=x-{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-x^{-2}\right)-\ln 2\pi$ (4)

And the importance highlights that fact that if the Perron relation is satisfied, then, this fixed point must highlight the roots of the Riemann Zeta function as complex arguments that take the Zeta-function from the complex arguments to real arguments to converge to the constant $z_w=-0.29590500557213955$ .

I.N. Galidakis [2] discussed the ${\text{slog}}_T\left(z\right)$ function extensively.

A general series extension of the function ${\text{slog}}_k\left(s\right)$ is given by:

${\text{slog}}_k\left(s\right)={\displaystyle \sum }_{k=0}^{\infty }\frac{s^k}{k!}{v}_k$ (5)

where, for $0\le s\le 1$ , and,

$v_k=\frac{1}{\left(k-1\right)!}\frac{{\text{d}}^k}{\text{d}{s}^k}{\left[s^{k-1}{\text{slog}}_k\left(\zeta \left(s\right)\right)\right]}_{s=0}$ (6)

and where, $v_k$ are normalized constants by the factorial. The same kind of relation in (6) was found by Xi Li, [3] for the vanishing of the Riemann Zeta functions.

Let $\left\{{\lambda }_k\right\}$ be a sequence of numbers ${\lambda }_k$ , given by

${\lambda }_k=\frac{1}{\left(k-1\right)!}\frac{{\text{d}}^k}{\text{d}{s}^k}{\left[s^{k-1}\log \left({\xi }_k\left(s\right)\right)\right]}_{s=1}$ (7)

for all positive integers k, where,

$\xi \left(s\right)=\frac{1}{2}s\left(s-1\right){\pi }^{-\frac{s}{2}}\Gamma \left(\frac{s}{2}\right)\zeta \left(s\right)$ (8)

with $\zeta \left(s\right)$ being the Riemann ζ-function. Xi Li [3] showed that the Riemann hypothesis is equivalent to the positivity of the sequence of the real numbers ${\lambda }_k$ defined by the relation,

${\lambda }_k={\displaystyle \sum }_{\rho }\left[1-{\left(1-\frac{1}{\rho }\right)}^k\right]\ge 0$ (9)

where the sum is taken over all nontrivial zeros of the function, $\xi \left(s\right)$ with $\rho$ and $1-\rho$ being paired together.

The aim of this paper is to show that the fixed points of an infinite number of iterations of any number theoretic function defined by an infinite number field are defined by functions such that ${\lim }_{T\to \infty }{f}^T\left(z\right)=z_{\infty }$ , since $f^{\infty }\left(z\right)=f\left(z_{\infty }\right)=z_{\infty }$ .

2. Iterations of Perron’s Formula

Define the Mangoldt function,

$\Lambda \left(n\right)=\{\begin{array}{ll}\log p,\hfill & \text{if}x=p^a,p\text{is a}\text{prime}\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}$ (10)

Obviously, the function $\Lambda \left(n\right)$ is a weighing function on the primes. Thus, the function is related to the Least Common Multiple of numbers n and below,

${\displaystyle \sum }_{m\le n}\Lambda \left(m\right)=\log \left(\text{LCM}\left(1,2,3,\cdots ,n\right)\right)$ (11)

The relation to the Riemann zeta function is given by: J. B. Conrey [4], and by Titchmarsh [5].

${\displaystyle \sum }_{n=1}^{\infty }\frac{\Lambda \left(m\right)}{n^s}=-\frac{{\zeta }^{\prime }\left(s\right)}{\zeta \left(s\right)}$ (12)

Obviously when $s=0$ , (12) gives the sum:

${\displaystyle \sum }_{n=1}^{\infty }\Lambda \left(m\right)=-\frac{{\zeta }^{\prime }\left(0\right)}{\zeta \left(0\right)}=-\log 2\pi$ (13)

Define the function:

$\psi \left(x\right)=\underset{T\to \infty }{\lim }\frac{1}{2\pi i}{\displaystyle \underset{c-iT}{\overset{c+iT}{\int }}\left(\frac{{\zeta }^{\prime }\left(s\right)}{\zeta \left(s\right)}\frac{x^s}{s}\right)\text{d}s}$ (14)

The function (14) is well-known as Perron’s formula, [5], and is related to the roots of the Riemann Zeta function via residue theorem as the explicit formula:

$\psi \left(x\right)=x-{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-x^{-2}\right)-\ln 2\pi$ (15)

Define the iteration

${\psi }^k\left(x\right)=\underset{k\text{-times}}{\underbrace{\psi \left(\psi \left(\psi \cdots \left(\psi \left(x\right)\right)\right)\right)}}$

with ${\psi }^0\left(x\right)=x$ . Here k is not a power but a level for the iterations. Then,

${\psi }^1\left(x\right)=\psi \left({\psi }^0\left(x\right)\right)={\psi }^0\left(x\right)-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^0\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-{\psi }^0{\left(x\right)}^{-2}\right)-\ln 2\pi$ (16)

Then,

${\psi }^2\left(x\right)=\psi \left({\psi }^1\left(x\right)\right)={\psi }^1\left(x\right)-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^1\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-{\psi }^1{\left(x\right)}^{-2}\right)-\ln 2\pi$ (17)

i.e.,

$\begin{array}{c}{\psi }^2\left(x\right)=\left[{\psi }^0\left(x\right)-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^0\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-{\psi }^0{\left(x\right)}^{-2}\right)-\ln 2\pi \right]\\ -{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^1\left(x\right)\right)}^{\rho }}{\rho }-\ln 2\pi -\frac{1}{2}\ln \left(1-{\psi }^1{\left(x\right)}^{-2}\right)\end{array}$ (18)

$\begin{array}{c}{\psi }^2\left(x\right)={\psi }^0\left(x\right)-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^0\left(x\right)\right)}^{\rho }+{\left({\psi }^1\left(x\right)\right)}^{\rho }}{\rho }\\ -\frac{1}{2}\ln \left(1-{\psi }^0{\left(x\right)}^{-2}\right)\left(1-{\psi }^1{\left(x\right)}^{-2}\right)-2\ln 2\pi \end{array}$ (19)

${\psi }^3\left(x\right)=\psi \left({\psi }^2\left(x\right)\right)={\psi }^2\left(x\right)-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^2\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-{\left({\psi }^2\right)}^{-2}\right)-\ln 2\pi$ (20)

$\begin{array}{c}{\psi }^3\left(x\right)={\psi }^0\left(x\right)-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^0\left(x\right)\right)}^{\rho }+{\left({\psi }^1\left(x\right)\right)}^{\rho }+{\left({\psi }^2\left(x\right)\right)}^{\rho }}{\rho }\\ -\frac{1}{2}\ln \left[\left(1-{\psi }^0{\left(x\right)}^{-2}\right)\left(1-{\psi }^1{\left(x\right)}^{-2}\right)\left(1-{\left({\psi }^2\right)}^{-2}\right)\right]-3\ln 2\pi \end{array}$ (21)

We conclude by induction that the k^th term is given by for $n\le k$ :

${\psi }^k\left(x\right)={\psi }^0\left(x\right)-{\displaystyle \sum }_{\rho }{\displaystyle \sum }_{n=0}^k\frac{{\left({\psi }^n\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln {\displaystyle \prod }_{n=0}^k\left(1-{\left({\psi }^n\left(x\right)\right)}^{-2}\right)-k\ln 2\pi$ (22)

And,

${\psi }^k\left(x\right)=x-{\displaystyle \sum }_{\rho }{\displaystyle \sum }_{n=0}^k\frac{{\left({\psi }^n\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln {\displaystyle \prod }_{n=0}^k\left(1-{\left({\psi }^n\left(x\right)\right)}^{-2}\right)-k\ln 2\pi$ (23)

Note that x is a stationary term in all the inducts.

Iterative functions are discussed by Baker, I.N. and Rippon, P.J. [6].

The function ${\psi }^k\left(x\right)$ , follows the same rules as the original (15).

The question arises, what is the meaning of ${\psi }^k\left(x\right)$ ?

The function $\psi \left(x\right)$ is the log of the least common multiple of the integers from 1 through x. For example,

$\begin{array}{c}\psi \left(10\right)={\displaystyle \sum }_{n=0}^{10}\Lambda \left(n\right)\\ =0+\log 2+\log 3+\log 2+\log 5+0+\log 7+\log 2+\log 3+0\\ =\log \left(2520\right)\end{array}$ (24)

It is clear that $\psi \left(x\right)={\displaystyle {\sum }_p\log p}$ , is defined over primes, p, and the iterations become,

$\psi \left(\psi \left(x\right)\right)=\psi \left(\log \left(\text{LCM}\left(x\right)\right)\right)=\log \left(\text{LCM}\left(\log \left(\text{LCM}\left(x\right)\right)\right)\right)=\log \left(q\right)$

where, q is the expression of some numbers that serves as the “prime factors” of the super-logs,

$\Lambda \left(x\right)=\{\begin{array}{ll}\log q,\hfill & \text{if}x=q^a,q\text{is a}"\text{primitive number}"\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}$ (25)

$\psi \left(\psi \left(x\right)\right)=\psi \left(\log \left(\text{LCM}\left(x\right)\right)\right)=\log \left(\text{LCM}\left(\log \left(\text{LCM}\left(x\right)\right)\right)\right)=\log \left(q\right)$

STATEMENT 1:

An infinite number of iterations can only be carried out when $k\to \infty$ , $x\to \infty$ , otherwise, the iteration is finite.

LEMMA1:

${\psi }^{k+2}\left(x\right)-2{\psi }^{k+1}\left(x\right)+{\psi }^k\left(x\right)=0$ (26)

Proof:

${\psi }^k\left(x\right)=x-{\displaystyle \sum }_{\rho }{\displaystyle \sum }_{n=0}^k\frac{{\left({\psi }^n\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln {\displaystyle \prod }_{n=0}^k\left(1-{\left({\psi }^n\left(x\right)\right)}^{-2}\right)-k\ln 2\pi$ (27)

${\psi }^{k+1}\left(x\right)=x-{\displaystyle \sum }_{\rho }{\displaystyle \sum }_{n=0}^{k+1}\frac{{\left({\psi }^n\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln {\displaystyle \prod }_{n=0}^{k+1}\left(1-{\left({\psi }^n\left(x\right)\right)}^{-2}\right)-\left(k+1\right)\ln 2\pi$ (28)

$\begin{array}{l}{\psi }^{k+1}\left(x\right)-{\psi }^k\left(x\right)\\ =x-{\displaystyle \sum }_{\rho }{\displaystyle \sum }_{n=0}^{k+1}\frac{{\left({\psi }^n\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln {\displaystyle \prod }_{n=0}^{k+1}\left(1-{\left({\psi }^n\left(x\right)\right)}^{-2}\right)-\left(k+1\right)\ln 2\pi \\ -x+{\displaystyle \sum }_{\rho }{\displaystyle \sum }_{n=0}^k\frac{{\left({\psi }^n\left(x\right)\right)}^{\rho }}{\rho }+\frac{1}{2}\ln {\displaystyle \prod }_{n=0}^k\left(1-{\left({\psi }^n\left(x\right)\right)}^{-2}\right)+k\ln 2\pi \end{array}$

${\psi }^{k+1}\left(x\right)-{\psi }^k\left(x\right)=-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^{k+1}\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-{\left({\psi }^{k+1}\left(x\right)\right)}^{-2}\right)-\ln 2\pi$ (29)

$\psi \left({\psi }^{k+1}\left(x\right)\right)-{\psi }^{k+1}=-{\displaystyle \sum }_{\rho }\frac{{\left({\psi }^{k+1}\left(x\right)\right)}^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-{\left({\psi }^{k+1}\left(x\right)\right)}^{-2}\right)-\ln 2\pi$ (30)

${\psi }^{k+1}\left(x\right)-{\psi }^k\left(x\right)={\psi }^{k+2}\left(x\right)-{\psi }^{k+1}\left(x\right)$ (31)

${\psi }^{k+2}\left(x\right)=2{\psi }^{k+1}\left(x\right)-{\psi }^k\left(x\right)$ (32)

We will now use LEMMA 1 and STATEMENT 1 to prove the following Theorem.

THEOREM: ${\lim }_{k\to \infty }{\psi }^k\left(x\right)=x$ if and only if ${\lim }_{x\to \infty }\psi \left(x\right)=x$ .

Proof:

It is clear from (32) for example, that

$\psi \left(x\right)=x-{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\frac{1}{2}\ln \left(1-x^{-2}\right)-\ln 2\pi$ (33)

And for $k=0$ , in

${\psi }^{k+2}\left(x\right)=2{\psi }^{k+1}\left(x\right)-{\psi }^k\left(x\right)$ (34)

${\psi }^2\left(x\right)=2\psi \left(x\right)-x=0$ (35)

${\psi }^2\left(x\right)=x-2{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\ln \left(1-x^{-2}\right)-2\ln 2\pi$ (36)

Similarly, for $k=1$ ,

${\psi }^3\left(x\right)=2{\psi }^2\left(x\right)-\psi \left(x\right)$ (37)

${\psi }^3\left(x\right)=x-3{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\frac{3}{2}\ln \left(1-x^{-2}\right)-3\ln 2\pi$ (38)

and for $k=2$ ,

${\psi }^4\left(x\right)=2{\psi }^3\left(x\right)-{\psi }^2\left(x\right)$ (39)

$\begin{array}{c}{\psi }^4\left(x\right)=2\left(x-3{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\frac{3}{2}\ln \left(1-x^{-2}\right)-3\ln 2\pi \right)\\ -\left(x-2{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\ln \left(1-x^{-2}\right)-2\ln 2\pi \right)\end{array}$ (40)

${\psi }^4\left(x\right)=x-4{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-2\ln \left(1-x^{-2}\right)-4\ln 2\pi$ (41)

and for $k=4$ ,

${\psi }^5\left(x\right)=2{\psi }^4\left(x\right)-{\psi }^3\left(x\right)$ (42)

${\psi }^5\left(x\right)=x-5{\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }-\frac{5}{2}\ln \left(1-x^{-2}\right)-5\ln 2\pi$ (43)

In general, by induction,

${\psi }^k\left(x\right)=x-k\left({\displaystyle \sum }_{\rho }\frac{x^{\rho }}{\rho }+\frac{1}{2}\ln \left(1-x^{-2}\right)+\ln 2\pi \right)$ (44)

We arrive at the beautiful relation:

$x-{\psi }^k\left(x\right)=k\left(x-\psi \left(x\right)\right)$ (45)

The iterations can proceed to infinite values of k. In most iterations, the fixed points are dependent on the starting value of the argument for the function and terminate at some fixed value that becomes independent of k. However, Perron’s formula indicates that the functional relations for the iterated flow of arguments depends and is proportional to the number of iterations, k. This implies a continuity of the iterants to infinite values, hence the limits of the theorem. This completes the proof, since, when $x=\psi \left(x\right)$ , then, $x={\psi }^k\left(x\right)$ , and x is a fixed value, that is only satisfied by the condition:

${\lim }_{k\to \infty }{\psi }^k\left(x\right)=x$ if and only if ${\lim }_{x\to \infty }\psi \left(x\right)=x$ (46)

3. Conclusions

The existence of fixed points of iterations provides a unique perspective on number theoretic functions. An iteration can continue indefinitely if the validity of the function is adhered to within the range of the iterants. It is well known that the prime number theorem indicates the main theorem given above. The main conclusion of the theorem requires the validity of the exponentiation of the Perron’s function for an infinite sequence. Not all functions require an infinite number of iterations to converge. For example, the functional iterations of the Sums of Divisors $\sigma \left(N_0\right)$ following the sequence,

$\begin{array}{c}\left(N_0\right)\equiv N_0,\\ \left(\sigma \left(N_0\right)-1\right)=N,\\ \left(\sigma \left(\sigma \left(N_0\right)-1\right)-1\right)=N_2\\ \left(\sigma \left(\sigma \left(\sigma \left(N_0\right)-1\right)-1\right)-1\right)=N_3\\ \cdots \left(\sigma \left(\sigma \left(\cdots \sigma \left(N_0\right)-1\right)-1\right)\cdots -1\right)=N_k=N_{k+1}=N_{k+2}=\cdots =N_{\infty }\end{array}$ (47)

terminates at different intervals of iterations. Amazingly, the sequence lengths k, can be conclusively determined to be less than some finite number for any integer. An example of this iteration is given in the table below. The question remains as to whether there exists a function that describes k for all N₀, since, the iterations are dependent on only a specific set of primes and such a function will have its zeroes defined by the primes.

N0	Iterations	k	Fixed points N∞
2	[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]	0	3
3	[3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]	0	4
4	[4, 6, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11]	3	12
5	[5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]	0	6
6	[6, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11]	2	12
7	[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]	0	8
8	[8, 14, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]	3	24
9	[9, 12, 27, 39, 55, 71, 71, 71, 71, 71, 71, 71, 71]	6	72
10	[10, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17]	2	18
11	[11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11]	0	12
12	[12, 27, 39, 55, 71, 71, 71, 71, 71, 71, 71, 71, 71]	5	72
13	[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]	0	14
14	[14, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]	2	24
15	[15, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]	2	24
16	[16, 30, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71]	3	72
17	[17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17]	0	18
18	[18, 38, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59]	3	60
19	[19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19]	0	20
20	[20, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41]	2	42
3000	[3000, 9359, 10943, 11327, 11615, 14687, 15479, 16175, 20087, 20519, 22103, 23831, 23831]	12	23832

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1]	Anthony, M.M. (2016) The Towering Zeta Function. Advances in Pure Mathematics, 6, 351-392. https://doi.org/10.4236/apm.2016.65026
[2]	Galidakis, I.N. (2004) On an Application of Lambert'swfunction to Infinite Exponentials. Complex Variables, Theory and Application: An International Journal, 49, 759-780. https://doi.org/10.1080/02781070412331298796
[3]	Li, X. (1997) The Positivity of a Sequence of Numbers and the Riemann Hypothesis. Journal of Number Theory, 65, 325-333. https://doi.org/10.1006/jnth.1997.2137
[4]	Conrey, J.B. (1989) More Than Two Fifths of the Zeros of the Riemann Zeta Function Are on the Critical Line, Journal fur die Reine und Angewandte Mathematik, 399, 1-16. https://doi.org/10.1515/crll.1989.399.1
[5]	E. C. Titchmarsh F.R.S. (1986) The Theory of the Riemann Zeta Function. Clarendon Press.
[6]	Baker, I.N. and Rippon, P.J. (1985) A Note on Complex Iteration. The American Mathematical Monthly, 92, 501-504. https://doi.org/10.1080/00029890.1985.11971666