Exponential factorial explained

The exponential factorial is a positive integer n raised to the power of n − 1, which in turn is raised to the power of n − 2, and so on in a right-grouping manner. That is,

n ^{(n -1 ) ^{(n}}

The exponential factorial can also be defined with the recurrence relation

a _{1} = 1 , a _{n} = n ^{a _{n}}

The first few exponential factorials are 1, 2, 9, 262144, ... (or). For example, 262144 is an exponential factorial since

262144 = 4 ^{3 ^{2 ^{1}}} Using the recurrence relation, the first exponential factorials are:

1

2¹ = 2

3² = 9

4⁹ = 262144

5²⁶²¹⁴⁴ = 6206069878...8212890625 (183231 digits)

The exponential factorials grow much more quickly than regular factorials or even hyperfactorials. The number of digits in the exponential factorial of 6 is approximately 5 × 10^{183 230}.

The sum of the reciprocals of the exponential factorials from 1 onwards is the following transcendental number:

(1)/(+ 1) (1)/(+ 2 ^{1}) (1)/(+ 3 ^{2 ^{1}}) (1)/(+ 4 ^{3 ^{2 ^{1}}}) (1)/(+ 5 ^{4 ^{3 ^{2 ^{1}}}}) (1)/(6 ^{5 ^{4 ^{3 ^{2 ^{1}}}}}) + \ldots =1 . 611114925808376736 \underbrace{ 111111111111 \ldots 111111111111 } _{183212} 272243682859 \ldots

This sum is transcendental because it is a Liouville number.

Like tetration, there is currently no accepted method of extension of the exponential factorial function to real and complex values of its argument, unlike the factorial function, for which such an extension is provided by the gamma function. But it is possible to expand it if it is defined in a strip width of 1.

Similarly, there is disagreement about the appropriate value at 0; any value would be consistent with the recursive definition. A smooth extension to the reals would satisfy

f( 0 ) = f'( 1 ) , which suggests a value strictly between 0 and 1.

References

• Jonathan Sondow, "Exponential Factorial" From Mathworld, a Wolfram Web resource