<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=146.201.213.39</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=146.201.213.39"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/146.201.213.39"/>
	<updated>2026-10-08T02:57:51Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Louvre_Pyramid&amp;diff=11987</id>
		<title>Louvre Pyramid</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Louvre_Pyramid&amp;diff=11987"/>
		<updated>2014-01-24T14:58:32Z</updated>

		<summary type="html">&lt;p&gt;146.201.213.39: Changed height from 20.6m/70 ft (an incorrect conversion) to 21.6m/71ft, which matches the referenced source and other external sources that do not cite Wikipedia. 20.6 was probably a typographical error.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;An &#039;&#039;&#039;exponential factorial&#039;&#039;&#039; is a positive integer &#039;&#039;n&#039;&#039; [[exponentiation|raised to the power]] of &#039;&#039;n&#039;&#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1, which in turn is raised to the power of &#039;&#039;n&#039;&#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;2, and so on and so forth, that is,&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;n^{(n - 1)^{(n - 2) \cdots }}.\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The exponential factorial can also be defined with the [[recurrence relation]]&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;a_0 = 1,\quad  a_n = n^{a_{n - 1}}.\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The first few exponential factorials are [[1 (number)|1]], [[1 (number)|1]], [[2 (number)|2]], [[9 (number)|9]], 262144, etc. {{OEIS|id=A049384}}. So, for example, 262144 is an exponential factorial since&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;262144 = 4^{3^{2^{1}}}.\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The exponential factorials grow much more quickly than regular [[factorial]]s or even [[Factorial#Hyperfactorial|hyperfactorial]]s. The exponential factorial of 5 is 5&amp;lt;sup&amp;gt;262144&amp;lt;/sup&amp;gt; which is approximately 6.206069878660874&amp;amp;nbsp;&amp;amp;times;&amp;amp;nbsp;10&amp;lt;sup&amp;gt;183230&amp;lt;/sup&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The sum of the reciprocals of the exponential factorials from 1 onwards is the [[transcendental number]] 1.6111149258083767361111... {{OEIS2C|id=A080219}}.&lt;br /&gt;
&lt;br /&gt;
Like [[tetration]], there is currently no accepted method of extension of the exponential factorial function to [[real number|real]] and [[complex number|complex]] values of its argument, unlike the [[factorial]] function, for which such an extension is provided by the [[gamma function]].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
*Jonathan Sondow, &amp;quot;[http://mathworld.wolfram.com/ExponentialFactorial.html Exponential Factorial]&amp;quot; From [[Mathworld]], a Wolfram Web resource&lt;br /&gt;
&lt;br /&gt;
[[Category:Factorial and binomial topics]]&lt;br /&gt;
[[Category:Integer sequences]]&lt;br /&gt;
[[Category:Large integers]]&lt;br /&gt;
&lt;br /&gt;
{{Numtheory-stub}}&lt;/div&gt;</summary>
		<author><name>146.201.213.39</name></author>
	</entry>
</feed>