blocks|key|6265543|text|05AB1E，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6265544|代码：|unstyled|6265545|Ý!DmO|code-block|syntax|javascript|6265546|解释：|6265547|Ý+++++++#+Take+the+range+[0,+...,+input]
+!++++++#+Map+factorial+over+each+element
++Dm++++#+Exponentiate+each+element+to+itself
++++O+++#+Take+the+sum|6265548|使用CP-1252编码。在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://github.com/Adriandmen/05AB1E|1|http://05ab1e.tryitonline.net/#code=w50hRG1P&input=Mw^0|0|6|0|0|0|0|0|0|C|6|1^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|15|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|16|8|@]|9|@]|C|$]]|$1|N|3|O|5|I|7|17|8|@]|9|@]|C|$J|K]]|$1|P|3|Q|5|F|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="http://github.com/Adriandmen/05AB1E" rel="noreferrer">05AB1E</a>, 5 bytes</h1>

<p>Code:</p>

<pre><code>Ý!DmO
</code></pre>

<p>Explanation:</p>

<pre><code>Ý       # Take the range [0, ..., input]
 !      # Map factorial over each element
  Dm    # Exponentiate each element to itself
    O   # Take the sum
</code></pre>

<p>Uses the <strong>CP-1252</strong> encoding. <a href="http://05ab1e.tryitonline.net/#code=w50hRG1P&amp;input=Mw" rel="noreferrer">Try it online!</a></p>


blocks|key|6265667|text|Mathematica，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6265668|Sum[n!%5En!,{n,0,#}]&|code-block|syntax|javascript|6265669|(对极为清晰的代码表示歉意;)|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>Mathematica, 19 bytes</h1>

<pre><code>Sum[n!^n!,{n,0,#}]&amp;
</code></pre>

<p>Apologies for the extremely clear code  ;)</p>


blocks|key|839820|text|果冻，6字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|839821|在网上试试！|unstyled|offset|length|839822|‘Ḷ!*`S+//+Main+link:+Argument+n+(integer)
‘++++++//+Take+n,+increment+by+1
+Ḷ+++++//+Range+from+[0..n]
++!++++//+Calculates+factorial+for+each+[0..n]
+++*`++//+Raises+each+[0!..n!]+to+the+power+of+itself
+++++S+//+Sum+the+resulting+array|code-block|syntax|javascript|entityMap|0|LINK|mutability|MUTABLE|url|http://jelly.tryitonline.net/#code=4oCY4bi2ISpgUw&input=&args=Mw^0|0|0|6|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@$E|U|F|V|1|W]]|A|$]]|$1|G|3|H|5|I|7|X|8|@]|9|@]|A|$J|K]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Jelly, 6 bytes</h1>

<p><a href="http://jelly.tryitonline.net/#code=4oCY4bi2ISpgUw&amp;input=&amp;args=Mw" rel="nofollow noreferrer">Try it online!</a></p>

<pre><code>‘Ḷ!*`S // Main link: Argument n (integer)
‘      // Take n, increment by 1
 Ḷ     // Range from [0..n]
  !    // Calculates factorial for each [0..n]
   *`  // Raises each [0!..n!] to the power of itself
     S // Sum the resulting array
</code></pre>


blocks|key|839746|text|马蒂尔，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|839747|Q:Ygt%5Es|code-block|syntax|javascript|839748|在网上试试！|unstyled|839749|解释|839750|Q+++++++++%25+Take+input+n+implicitly.+Add+1
+:++++++++%25+Range+[1+2+...+n%2B1]
++Yg++++++%25+Gamma+function,+element-wise.+This+gives+[0!+1!+...+n!]
++++t%5E++++%25+Rise+result+to+itself,+element-wise
++++++s+++%25+Sum+all+values.+Implicitly+display|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/nexus/matl#@x9oFZleElf8/78xAA^0|0|3|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/lmendo/MATL" rel="nofollow noreferrer">MATL</a>, 7 bytes</h1>
<pre><code>Q:Ygt^s
</code></pre>
<p><a href="https://tio.run/nexus/matl#@x9oFZleElf8/78xAA" rel="nofollow noreferrer" title="MATL – TIO Nexus">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>Q         % Take input n implicitly. Add 1
 :        % Range [1 2 ... n+1]
  Yg      % Gamma function, element-wise. This gives [0! 1! ... n!]
    t^    % Rise result to itself, element-wise
      s   % Sum all values. Implicitly display
</code></pre>


blocks|key|6265706|text|JavaScript+(ES7)，38字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6265707|f=(n,a=1,i=0)=>i>n?0:a**a%2Bf(n,a*%2B%2Bi,i)|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h2>JavaScript (ES7), 38 bytes</h2>

<pre><code>f=(n,a=1,i=0)=&gt;i&gt;n?0:a**a+f(n,a*++i,i)
</code></pre>


blocks|key|6265847|text|帕里/GP，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6265848|n->sum(k=0,n,k!%5Ek!)|code-block|syntax|javascript|entityMap|0|LINK|mutability|MUTABLE|url|http://pari.math.u-bordeaux.fr/^0|0|5|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]]|C|$]]|$1|D|3|E|5|F|7|T|8|@]|9|@]|C|$G|H]]]|I|$J|$5|K|L|M|C|$N|O]]]]

<h1><a href="http://pari.math.u-bordeaux.fr/" rel="nofollow noreferrer">PARI/GP</a>, 19 bytes</h1>

<pre><code>n-&gt;sum(k=0,n,k!^k!)
</code></pre>


blocks|key|840259|text|GameMaker语言，97字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|840260|主函数(52个字节)|unstyled|840261|for(a=0;a<=argument0;a%2B%2B)b%2B=power(f(a),f(a))return+b|code-block|syntax|javascript|840262|函数f(45个字节)|840263|a=argument0+if!a+return+1else+return+a*f(a--)|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|Q|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|S|8|@]|9|@]|A|$H|I]]]|N|$]]

<h1>GameMaker Language, 97 bytes</h1>
<p>Main function (52 bytes)</p>
<pre><code>for(a=0;a&lt;=argument0;a++)b+=power(f(a),f(a))return b
</code></pre>
<p>Function f (45 bytes)</p>
<pre><code>a=argument0 if!a return 1else return a*f(a--)
</code></pre>


blocks|key|6266136|text|Dyalog+APL，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6266137|(%2B/!*!)0,⍳|code-block|syntax|javascript|6266138|怎么做？|6266139|⍳输入范围|unstyled|offset|length|style|CODE|6266140|0,前面有0|6266141|!*!应用x!+%5E+x!|6266142|%2B/和|entityMap^0|0|0|0|0|1|0|0|2|0|0|3|5|7|0|0|2^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Y|8|@]|9|@]|A|$]]|$1|I|3|J|5|K|7|Z|8|@$L|10|M|11|N|O]]|9|@]|A|$]]|$1|P|3|Q|5|K|7|12|8|@$L|13|M|14|N|O]]|9|@]|A|$]]|$1|R|3|S|5|K|7|15|8|@$L|16|M|17|N|O]|$L|18|M|19|N|O]]|9|@]|A|$]]|$1|T|3|U|5|K|7|1A|8|@$L|1B|M|1C|N|O]]|9|@]|A|$]]]|V|$]]

<h1>Dyalog APL, 10 bytes</h1>

<pre><code>(+/!*!)0,⍳
</code></pre>

<p><strong>How?</strong></p>

<p><code>⍳</code> range of input</p>

<p><code>0,</code> preceded with 0</p>

<p><code>!*!</code> apply <code>x! ^ x!</code></p>

<p><code>+/</code> sum</p>


blocks|key|6266344|text|戈尔夫脚本，41字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6266345|{.{,{1%2B}%25{*}*}{;1}if}:f;~.,\%2B{.f\f?}%25{%2B}*|code-block|syntax|javascript|6266346|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://www.golfscript.com/golfscript/index.html|1|https://tio.run/##S8/PSStOLsosKPn/v1qvWqfaULtWtVqrVqu22tqwNjOt1irNuk5PJ0a7Wi8tJs0eKKddq/X/vzEA^0|0|5|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://www.golfscript.com/golfscript/index.html" rel="nofollow noreferrer">Golfscript</a>, 41 bytes</h1>
<pre><code>{.{,{1+}%{*}*}{;1}if}:f;~.,\+{.f\f?}%{+}*
</code></pre>
<p><a href="https://tio.run/##S8/PSStOLsosKPn/v1qvWqfaULtWtVqrVqu22tqwNjOt1irNuk5PJ0a7Wi8tJs0eKKddq/X/vzEA" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|6266490|text|图诺+%2B，7+\log_{256}(96)+\approx++5.76字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|6266491|RFDz.%5ES|code-block|syntax|javascript|6266492|在网上试试！|unstyled|6266493|解释|6266494|RFDz.%5ES++#+implicit+input
+++++++++#+%2B+flag+adds+one
R++++++++#+range+from+0
+F+++++++#+factorial+of+each
+++z.++++#+for+each+number:
++D++%5E+++#++raise+it+to+the+power+of+itself
++++++S++#+sum+the+resulting+list
+++++++++#+implicit+output|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Thunno/Thunno|1|INLINETEX|IMMUTABLE|teX|7+\log_{256}(96)+\approx+|2|https://ato.pxeger.com/run?1=m72sJKM0Ly9_abSStlLsgqWlJWm6FsuD3Fyq9OKCITyo4IKFxhAGAA^0|3|1|5|P|0|2|0|5|P|1|0|0|0|6|2|0|0^^$0|@$1|2|3|4|5|6|7|15|8|@$9|16|A|17|B|C]|$9|18|A|19|B|C]]|D|@$9|1A|A|1B|1|1C]|$9|1D|A|1E|1|1F]]|E|$]]|$1|F|3|G|5|H|7|1G|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1H|8|@]|D|@$9|1I|A|1J|1|1K]]|E|$]]|$1|N|3|O|5|6|7|1L|8|@]|D|@]|E|$]]|$1|P|3|Q|5|H|7|1M|8|@]|D|@]|E|$I|J]]]|R|$S|$5|T|U|V|E|$W|X]]|Y|$5|Z|U|10|E|$11|12]]|13|$5|T|U|V|E|$W|14]]]]

<h1><a href="https://github.com/Thunno/Thunno" rel="nofollow noreferrer">Thunno</a> <code>+</code>, <span class="math-container">\$ 7 \log_{256}(96) \approx \$</span> 5.76 bytes</h1>
<pre><code>RFDz.^S
</code></pre>
<p><a href="https://ato.pxeger.com/run?1=m72sJKM0Ly9_abSStlLsgqWlJWm6FsuD3Fyq9OKCITyo4IKFxhAGAA" rel="nofollow noreferrer">Attempt This Online!</a></p>
<h4>Explanation</h4>
<pre class="lang-python prettyprint-override"><code>RFDz.^S  # implicit input
         # + flag adds one
R        # range from 0
 F       # factorial of each
   z.    # for each number:
  D  ^   #  raise it to the power of itself
      S  # sum the resulting list
         # implicit output
</code></pre>


blocks|key|6265324|text|Mathematica，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6265325|Sum[a!%5Ea!,{a,0,#}]&|code-block|syntax|javascript|6265326|匿名函数。接受一个数字作为输入，并返回一个数字作为输出。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>Mathematica, 19 bytes</h1>

<pre><code>Sum[a!^a!,{a,0,#}]&amp;
</code></pre>

<p>Anonymous function. Takes a number as input, and returns a number as output.</p>


blocks|key|839598|text|Pyke，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|839599|hFSBD]1*B)s|code-block|syntax|javascript|839600|在这里试试！|unstyled|offset|length|839601|hF++++++++++-++for+i+in+range+(0,+input%2B1)
++SB++++++++-+++++product(range(1,+i%2B1)
++++D]1*++++-++++[%5E]*%5E
++++++++B+++-+++product(%5E)
++++++++++s+-+sum(%5E)|839602|有趣的事实:+Pyke没有阶乘内建，因为SB只有两个字节！|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|http://pyke.catbus.co.uk/?code=hFSBD%255D1%252aB%2529s&input=3^0|0|0|0|6|0|0|0|K|2^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|10|8|@]|9|@$J|11|K|12|1|13]]|A|$]]|$1|L|3|M|5|D|7|14|8|@]|9|@]|A|$E|F]]|$1|N|3|O|5|I|7|15|8|@$J|16|K|17|P|Q]]|9|@]|A|$]]]|R|$S|$5|T|U|V|A|$W|X]]]]

<h2>Pyke, 11 bytes</h2>
<pre><code>hFSBD]1*B)s
</code></pre>
<p><a href="http://pyke.catbus.co.uk/?code=hFSBD%5D1%2aB%29s&amp;input=3" rel="nofollow noreferrer">Try it here!</a></p>
<pre><code>hF          -  for i in range (0, input+1)
  SB        -     product(range(1, i+1)
    D]1*    -    [^]*^
        B   -   product(^)
          s - sum(^)
</code></pre>
<p>Fun fact: Pyke doesn't have a factorial built-in because <code>SB</code> is only 2 bytes!</p>


blocks|key|6265602|text|JavaScript+(ES7)，44字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6265603|g=n=>n?(f=a=>a?a*f(a-1):1)(n)**f(n)%2Bg(n-1):1|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>JavaScript (ES7), 44 bytes</h1>
<pre><code>g=n=&gt;n?(f=a=&gt;a?a*f(a-1):1)(n)**f(n)+g(n-1):1
</code></pre>


blocks|key|839918|text|Python2，82+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|839919|x=input()
s=0
for+z+in+range(x):
+t=1
+for+i+in+range(z%2B1):t*=i%2B1
+s%2B=t**t
print+s|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Python 2, 82 Bytes</h1>
<pre><code>x=input()
s=0
for z in range(x):
 t=1
 for i in range(z+1):t*=i+1
 s+=t**t
print s
</code></pre>


blocks|key|6265819|text|奇观，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6265820|@sum(->@%5E+f\prod+rng1#0f)rng0%2B1#0|code-block|syntax|javascript|6265821|用法：|unstyled|6265822|(@sum(->@%5E+f\prod+rng1#0f)rng0%2B1#0)3|6265823|解释|6265824|rng0%2B1#0|6265825|创建从0到输入的包含范围。|6265826|->@%5E+f\prod+rng1#0f|6265827|使用以下函数映射范围:+1)计算项目的阶乘，2)将结果存储到f，3)计算f%5Ef。|style|CODE|6265828|sum|6265829|总金额。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/wonderlang/wonder^0|0|2|0|0|0|0|0|0|0|0|0|U|1|10|3|0|0^^$0|@$1|2|3|4|5|6|7|1A|8|@]|9|@$A|1B|B|1C|1|1D]]|C|$]]|$1|D|3|E|5|F|7|1E|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1F|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|1G|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|6|7|1H|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1I|8|@]|9|@]|C|$G|H]]|$1|R|3|S|5|K|7|1J|8|@]|9|@]|C|$]]|$1|T|3|U|5|F|7|1K|8|@]|9|@]|C|$G|H]]|$1|V|3|W|5|K|7|1L|8|@$A|1M|B|1N|X|Y]|$A|1O|B|1P|X|Y]]|9|@]|C|$]]|$1|Z|3|10|5|F|7|1Q|8|@]|9|@]|C|$G|H]]|$1|11|3|12|5|K|7|1R|8|@]|9|@]|C|$]]]|13|$14|$5|15|16|17|C|$18|19]]]]

<h1><a href="https://github.com/wonderlang/wonder" rel="nofollow noreferrer">Wonder</a>, 33 bytes</h1>

<pre><code>@sum(-&gt;@^ f\prod rng1#0f)rng0+1#0
</code></pre>

<p>Usage:</p>

<pre><code>(@sum(-&gt;@^ f\prod rng1#0f)rng0+1#0)3
</code></pre>

<h1>Explanation</h1>

<pre><code>rng0+1#0
</code></pre>

<p>Create inclusive range from 0 to input.</p>

<pre><code>-&gt;@^ f\prod rng1#0f
</code></pre>

<p>Map over the range with a function that 1) calculates the factorial of the item, 2) stores the result to <code>f</code>, and 3) calculates <code>f^f</code>.</p>

<pre><code>sum
</code></pre>

<p>Sum.</p>


blocks|key|6265870|text|TI-Basic，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6265871|sum(seq(A!%5EA!,A,0,Ans|code-block|syntax|javascript|6265872|如果您有一个更新的操作系统(不改变大小)，您可以用sum(seq(替换Σ(。|unstyled|offset|length|style|CODE|entityMap^0|0|0|P|8|Z|2^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@$J|R|K|S|L|M]|$J|T|K|U|L|M]]|9|@]|A|$]]]|N|$]]

<h1>TI-Basic, 13 bytes</h1>
<pre><code>sum(seq(A!^A!,A,0,Ans
</code></pre>
<p>P.S. You can replace <code>sum(seq(</code> with <code>Σ(</code> if you have a newer operating system (no size change).</p>


blocks|key|840303|text|Ruby+2，41字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|840304|->n{(1..n).reduce(s=1){%7Ct,i%7Ct%2B(s*=i)**s}}|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Ruby 2, 41 bytes</h1>

<pre><code>-&gt;n{(1..n).reduce(s=1){|t,i|t+(s*=i)**s}}
</code></pre>


blocks|key|840555|text|外壳，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|840556|→ṁo´%5EΠḣ|code-block|syntax|javascript|840557|在网上试试！|unstyled|840558|→++++++++++One+plus
+ṁ+++++++++the+sum+of
+++++Π+++++x!
++++%5E++++++to+the+power+of
+++´+++++++itself
+ṁo++++++++for+each+x+in
++++++ḣ++++the+range+from+1+to
+++++++++++the+input.|840559|使用ṁo´%5EΠΘḣ稍微正确一些，实际上将0添加到范围中，但是由于0!%5E0!=1%5E1=1，这也有效。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/barbuz/Husk|1|https://tio.run/##AS4A0f9odXNr/yBt4oKB/@KGkuG5gW/CtF7OoOG4o////1swLDEsMiwzLDQsNSw2LDdd|2|https://tio.run/##AS0A0v9odXNr/yBt4oKB/@G5gW/CtF7OoM6Y4bij////WzAsMSwyLDMsNCw1LDYsN10^0|0|2|0|0|0|0|6|1|0|0|2|7|2|7|2^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|L|3|M|5|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1C|8|@$A|1D|B|1E|P|Q]]|9|@$A|1F|B|1G|1|1H]]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]]]

<h1><a href="https://github.com/barbuz/Husk" rel="nofollow noreferrer">Husk</a>, 7 bytes</h1>

<pre><code>→ṁo´^Πḣ
</code></pre>

<p><a href="https://tio.run/##AS4A0f9odXNr/yBt4oKB/@KGkuG5gW/CtF7OoOG4o////1swLDEsMiwzLDQsNSw2LDdd" rel="nofollow noreferrer" title="Husk – Try It Online">Try it online!</a></p>

<pre><code>→          One plus
 ṁ         the sum of
     Π     x!
    ^      to the power of
   ´       itself
 ṁo        for each x in
      ḣ    the range from 1 to
           the input.
</code></pre>

<p>It would be slightly more correct to use <a href="https://tio.run/##AS0A0v9odXNr/yBt4oKB/@G5gW/CtF7OoM6Y4bij////WzAsMSwyLDMsNCw1LDYsN10" rel="nofollow noreferrer"><code>ṁo´^ΠΘḣ</code></a>, actually adding 0 into the range, but since 0!^0!=1^1=1, this works too.</p>


blocks|key|840771|text|Pyt，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|840772|ř!ṖƩ⁺|code-block|syntax|javascript|840773|在网上试试！|unstyled|840774|ř+++++++++++implicit+input;+řangify
+!++++++++++factorial
++Ṗ+++++++++raise+n+to+the+nth+Ṗower
+++Ʃ++++++++Ʃum
++++⁺+++++++increment|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/mudkip201/pyt|1|https://tio.run/##K6gs@f//6EzFhzunHVv5qHHX///GAA^0|0|3|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/mudkip201/pyt" rel="nofollow noreferrer">Pyt</a>, 5 bytes</h1>
<pre><code>ř!ṖƩ⁺
</code></pre>
<p><a href="https://tio.run/##K6gs@f//6EzFhzunHVv5qHHX///GAA" rel="nofollow noreferrer" title="Pyt – Try It Online">Try it online!</a></p>
<pre><code>ř           implicit input; řangify
 !          factorial
  Ṗ         raise n to the nth Ṗower
   Ʃ        Ʃum
    ⁺       increment
</code></pre>


blocks|key|840828|text|维沙尔+s，4字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|840829|ʀ¡:e|code-block|syntax|javascript|840830|在网上试试！|unstyled|840831|ʀ++range+[0,+input]
¡++factorial+(vectorizes)
:++duplicate+list
e++exponentiate
s++sum|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://vyxal.pythonanywhere.com/#WyJzQSIsIiIsIsqAwqE6ZSIsIiIsIi0xXG4wXG4xXG4yXG4zIl0=^0|4|1|0|3|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|Y|8|@$9|Z|A|10|B|C]]|D|@$9|11|A|12|1|13]]|E|$]]|$1|F|3|G|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|15|8|@]|D|@$9|16|A|17|1|18]]|E|$]]|$1|N|3|O|5|H|7|19|8|@]|D|@]|E|$I|J]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]]]

<h1><a href="https://github.com/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a> <code>s</code>, 4 bytes</h1>
<pre><code>ʀ¡:e
</code></pre>
<p><a href="https://vyxal.pythonanywhere.com/#WyJzQSIsIiIsIsqAwqE6ZSIsIiIsIi0xXG4wXG4xXG4yXG4zIl0=" rel="nofollow noreferrer">Try it Online!</a></p>
<pre><code>ʀ  range [0, input]
¡  factorial (vectorizes)
:  duplicate list
e  exponentiate
s  sum
</code></pre>


blocks|key|6266549|text|阿图罗，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6266550|$=>[∑map..0&=>[%5E<=∏1..&]]|code-block|syntax|javascript|6266551|试试看|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://arturo-lang.io/|1|http://arturo-lang.io/playground?hN1cQ8^0|0|3|0|0|0|0|3|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://arturo-lang.io" rel="nofollow noreferrer">Arturo</a>, 29 bytes</h1>
<pre class="lang-arturo prettyprint-override"><code>$=&gt;[∑map..0&amp;=&gt;[^&lt;=∏1..&amp;]]
</code></pre>
<p><a href="http://arturo-lang.io/playground?hN1cQ8" rel="nofollow noreferrer">Try it</a></p>


blocks|key|6266697|text|斯塔克斯，10+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6266698|Ç╔Ñst(jÖ3l|code-block|syntax|javascript|6266699|运行并调试它|unstyled|6266700|这是PackedStax，它解压缩到以下11个字节：|6266701|R{%7CFc#}m%7C%2B%5E|6266702|6266703|R{++++}m++++#+map+over+range+1..input
++%7CF++++++++#+push+n!
++++c+++++++#+dup
+++++#++++++#+exponentiate
++++++++%7C%2B++#+sum
++++++++++%5E+#+increment+(deals+with+0+case)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/tomtheisen/stax|1|https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax|2|https://staxlang.xyz/#p=80c9a57374286a99336c&i=-1%250A0%250A1%250A2%250A3&m=2|3|https://staxlang.xyz/#c=R%257B%257CFc%2523%257Dm%257C%252B%255E&i=-1%250A0%250A1%250A2%250A3&m=2^0|0|4|0|8|3|1|0|0|0|6|2|0|0|0|0|6|3|0^^$0|@$1|2|3|4|5|6|7|15|8|@]|9|@$A|16|B|17|1|18]|$A|19|B|1A|1|1B]]|C|$]]|$1|D|3|E|5|F|7|1C|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|L|3|M|5|K|7|1H|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1I|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|Q|3|R|5|F|7|1N|8|@]|9|@]|C|$G|H]]]|S|$T|$5|U|V|W|C|$X|Y]]|Z|$5|U|V|W|C|$X|10]]|11|$5|U|V|W|C|$X|12]]|13|$5|U|V|W|C|$X|14]]]]

<h1><a href="https://github.com/tomtheisen/stax" rel="nofollow noreferrer">Stax</a>, 10 <a href="https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>Ç╔Ñst(jÖ3l
</code></pre>
<p><a href="https://staxlang.xyz/#p=80c9a57374286a99336c&amp;i=-1%0A0%0A1%0A2%0A3&amp;m=2" rel="nofollow noreferrer">Run and debug it</a></p>
<p>This is PackedStax, which unpacks to the following 11 bytes:</p>
<pre><code>R{|Fc#}m|+^
</code></pre>
<p><a href="https://staxlang.xyz/#c=R%7B%7CFc%23%7Dm%7C%2B%5E&amp;i=-1%0A0%0A1%0A2%0A3&amp;m=2" rel="nofollow noreferrer">Run and debug it</a></p>
<pre><code>R{    }m    # map over range 1..input
  |F        # push n!
    c       # dup
     #      # exponentiate
        |+  # sum
          ^ # increment (deals with 0 case)
</code></pre>


blocks|key|840886|text|C+(gcc)，71字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|840887|i,j,k;a(n){for(j=0;n%2B1;--n,j%2B=pow(i,i))for(i=k=1;n/%2B%2Bk;)i*=k;return+j;}|code-block|syntax|javascript|840888|您可以在线测试这里+(在网上试试！似乎缺少pow功能)。|unstyled|offset|length|style|CODE|840889|88-没有内置的字节解决方案：|840890|i,j,k,e;a(n){for(j=0;n%2B1;--n,j%2B=e){for(i=k=1;n/%2B%2Bk;)i*=k;for(e=k=i;--k;)e*=i;}return+j;}|840891|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://onlinegdb.com/XJ_Lr2ZqH|1|https://tio.run/##RY7NCoMwEITvPsUiCJsmUqXHbd6klxBr2YSuEmx7EJ89jdCfucxhvg/Gtzfvc2YTTCSHotZxShhsR6J7alsxQdt5eiEbVmrf2Ebbkxy1jqT4YCOl6/JIAoG2zLLA3bHgc@JBVWsFnxQTcF8ZLHRU6mzhRKA1K/hj38ypsCPWDptBFaMZLlIbYAMOyw/6CVu15Tc|2|https://tio.run/##RYvLCoMwEEX3fsUgCEkTqdLlNH/STdBYJqFjCbYb8dvTkb7uZoZz7xna6zCUQjbaZAN6xXqd5qyi65BNj23LNhoX3pRccj3y0ZiEmg4u4U6DUJKlsHCQb8theWSGiFshXuDmidVzplFXawWfiAhqbwkcdCjn7OCEYAxp@M@@uWfZTqr2qhm1GM144doCWfCKtMafsFVbeQE^0|0|0|L|3|7|2|0|B|6|1|0|0|0|0|6|2^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|15|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|16|8|@$J|17|K|18|L|M]]|9|@$J|19|K|1A|1|1B]|$J|1C|K|1D|1|1E]]|A|$]]|$1|N|3|O|5|I|7|1F|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|1G|8|@]|9|@]|A|$E|F]]|$1|R|3|S|5|I|7|1H|8|@]|9|@$J|1I|K|1J|1|1K]]|A|$]]]|T|$U|$5|V|W|X|A|$Y|Z]]|10|$5|V|W|X|A|$Y|11]]|12|$5|V|W|X|A|$Y|13]]]]

<h1>C (gcc), 71 bytes</h1>
<pre class="lang-c prettyprint-override"><code>i,j,k;a(n){for(j=0;n+1;--n,j+=pow(i,i))for(i=k=1;n/++k;)i*=k;return j;}
</code></pre>
<p>You can test it online <a href="https://onlinegdb.com/XJ_Lr2ZqH" rel="nofollow noreferrer">here</a> (<a href="https://tio.run/##RY7NCoMwEITvPsUiCJsmUqXHbd6klxBr2YSuEmx7EJ89jdCfucxhvg/Gtzfvc2YTTCSHotZxShhsR6J7alsxQdt5eiEbVmrf2Ebbkxy1jqT4YCOl6/JIAoG2zLLA3bHgc@JBVWsFnxQTcF8ZLHRU6mzhRKA1K/hj38ypsCPWDptBFaMZLlIbYAMOyw/6CVu15Tc" rel="nofollow noreferrer">Try It Online!</a> seems to lack the <code>pow</code> function).</p>
<p>88-byte solution without builtins:</p>
<pre class="lang-c prettyprint-override"><code>i,j,k,e;a(n){for(j=0;n+1;--n,j+=e){for(i=k=1;n/++k;)i*=k;for(e=k=i;--k;)e*=i;}return j;}
</code></pre>
<p><a href="https://tio.run/##RYvLCoMwEEX3fsUgCEkTqdLlNH/STdBYJqFjCbYb8dvTkb7uZoZz7xna6zCUQjbaZAN6xXqd5qyi65BNj23LNhoX3pRccj3y0ZiEmg4u4U6DUJKlsHCQb8theWSGiFshXuDmidVzplFXawWfiAhqbwkcdCjn7OCEYAxp@M@@uWfZTqr2qhm1GM144doCWfCKtMafsFVbeQE" rel="nofollow noreferrer">Try It Online!</a></p>


blocks|key|840956|text|Python+3，70字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|840957|import+math
x=lambda+n,f=math.factorial:1if+n==0else+f(n)**f(n)%2Bx(n-1)|code-block|syntax|javascript|840958|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##FcpBDgIhDEDRtZyiyzKOxomuJuEwVanTBAqpLPD0GDZ/8fLrrx1F72NIrsUaZGqH6yFRfr4JdOUw5cr0asWE0r4Jg4Zwi@kbgVH9ssyeO@pl84OLgYAoGOkn4sPv7lRNtKGs0FG8dx3n@Ac^0|0|8|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://docs.python.org/3/" rel="nofollow noreferrer">Python 3</a>, 70 bytes</h1>

<pre class="lang-python prettyprint-override"><code>import math
x=lambda n,f=math.factorial:1if n==0else f(n)**f(n)+x(n-1)
</code></pre>
<p><a href="https://tio.run/##FcpBDgIhDEDRtZyiyzKOxomuJuEwVanTBAqpLPD0GDZ/8fLrrx1F72NIrsUaZGqH6yFRfr4JdOUw5cr0asWE0r4Jg4Zwi@kbgVH9ssyeO@pl84OLgYAoGOkn4sPv7lRNtKGs0FG8dx3n@Ac" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>


blocks|key|6266030|text|C#，79个字节，控制台输出|type|header-two|depth|inlineStyleRanges|entityRanges|data|6266031|n=>{int+i=1,j=1;for(;i<=n;i%2B%2B)j*=i;System.Console.Write(System.Math.Pow(j,j));}|code-block|syntax|javascript|6266032|C#，64个字节作为返回|6266033|n=>{int+i=1,j=1;for(;i<=n;i%2B%2B)j*=i;return+System.Math.Pow(j,j);}|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|M|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|N|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|O|8|@]|9|@]|A|$E|F]]]|K|$]]

<h1>C#, 79 bytes with console output</h1>

<pre><code>n=&gt;{int i=1,j=1;for(;i&lt;=n;i++)j*=i;System.Console.Write(System.Math.Pow(j,j));}
</code></pre>

<h1>C#, 64 bytes as a return</h1>

<pre><code>n=&gt;{int i=1,j=1;for(;i&lt;=n;i++)j*=i;return System.Math.Pow(j,j);}
</code></pre>


blocks|key|6266081|text|球拍54字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6266082|(for/sum((i(%2B+1+n)))(let((t(factorial+i)))(expt+t+t)))|code-block|syntax|javascript|6266083|未高尔夫球：|unstyled|6266084|#lang+racket
(require+math)

(define+(f+n)
++(for/sum+((i+(%2B+1+n)))
++++(let+((t+(factorial+i)))
++++++(expt+t+t))))|6266085|测试：|6266086|(f+-1)
(f+0)
(f+1)
(f+2)
(f+3)|6266087|输出：|6266088|0
1
2
6
46662|entityMap^0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|Y|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|P|3|Q|5|I|7|10|8|@]|9|@]|A|$]]|$1|R|3|S|5|D|7|11|8|@]|9|@]|A|$E|F]]]|T|$]]

<h2>Racket 54 bytes</h2>

<pre><code>(for/sum((i(+ 1 n)))(let((t(factorial i)))(expt t t)))
</code></pre>

<p>Ungolfed: </p>

<pre><code>#lang racket
(require math)

(define (f n)
  (for/sum ((i (+ 1 n)))
    (let ((t (factorial i)))
      (expt t t))))
</code></pre>

<p>Testing:    </p>

<pre><code>(f -1)
(f 0)
(f 1)
(f 2)
(f 3)
</code></pre>

<p>Output: </p>

<pre><code>0
1
2
6
46662
</code></pre>


blocks|key|840485|text|[化]双模拟，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|840486|%2B/(*⍨∘!0,⍳)|code-block|syntax|javascript|840487|在网上试试！|unstyled|840488|这个函数序列等价于{%2B/*⍨!0,⍳⍵}，它是一个直接的实现。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://www.dyalog.com/|1|https://tio.run/##SyzI0U2pTMzJT9dNzkksLs5M/v8/TeFR2wQFbX0NrUe9Kx51zFA00HnUu1mT61HfVKBEGpAihfn/vwGXIZcRlzGXCQA^0|0|6|0|0|0|0|6|1|0|9|B^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@$A|18|B|19|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://www.dyalog.com/" rel="nofollow noreferrer">APL (Dyalog)</a>, 11 bytes</h1>



<pre class="lang-apl prettyprint-override"><code>+/(*⍨∘!0,⍳)
</code></pre>

<p><a href="https://tio.run/##SyzI0U2pTMzJT9dNzkksLs5M/v8/TeFR2wQFbX0NrUe9Kx51zFA00HnUu1mT61HfVKBEGpAihfn/vwGXIZcRlzGXCQA" rel="nofollow noreferrer" title="APL (Dyalog Classic) – Try It Online">Try it online!</a></p>

<hr>

<p>This function train is equivalent to <code>{+/*⍨!0,⍳⍵}</code>, which is a straight forward implementation</p>


blocks|key|6266320|text|05AB1E，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6266321|ƒN!N!m}O|code-block|syntax|javascript|6266322|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##yy9OTMpM/f//2CQ/RT/F3Fr///@NAQ^0|0|6|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 8 bytes</h1>

<pre><code>ƒN!N!m}O
</code></pre>

<p><a href="https://tio.run/##yy9OTMpM/f//2CQ/RT/F3Fr///@NAQ" rel="nofollow noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>


blocks|key|6266396|text|因子+%2B+math.factorials+math.unicode，29字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|6266397|[+[0,b]+[+n!+dup+%5E+]+map+Σ+]|code-block|syntax|javascript|6266398|在网上试试！|unstyled|6266399|++[0,b]++++++++++++++++++++++!+range+from+0+to+input+inclusive
++++++++[++++++++++]+map+++++!+map+over+each+element+in+the+range
++++++++++n!+++++++++++++++++!+factorial
+++++++++++++dup+%5E+++++++++++!+raised+to+itself
+++++++++++++++++++++++++Σ+++!+sum|entityMap|0|LINK|mutability|MUTABLE|url|https://factorcode.org/|1|https://tio.run/##LYw7DsIwEER7TjH0KAqfCg6AaGgQlRUk42zASrI29rpAiNNwH65kAqR7o3kzjTbiQj4edvvtGi0Fpg69lmsRNF8o/rn5WVZ3Y05sjatpLBMbsY4jIt0SsRlWPpDI3QfLgs3kgRJzLLDECs@soMrZuYICT1EnjxOq4cnj/UKVvxBFm7bIHw^0|5|S|0|2|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|Y|8|@$9|Z|A|10|B|C]]|D|@$9|11|A|12|1|13]]|E|$]]|$1|F|3|G|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|15|8|@]|D|@$9|16|A|17|1|18]]|E|$]]|$1|N|3|O|5|H|7|19|8|@]|D|@]|E|$I|J]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]]]

<h1><a href="https://factorcode.org/" rel="nofollow noreferrer">Factor</a> + <code>math.factorials math.unicode</code>, 29 bytes</h1>
<pre><code>[ [0,b] [ n! dup ^ ] map Σ ]
</code></pre>
<p><a href="https://tio.run/##LYw7DsIwEER7TjH0KAqfCg6AaGgQlRUk42zASrI29rpAiNNwH65kAqR7o3kzjTbiQj4edvvtGi0Fpg69lmsRNF8o/rn5WVZ3Y05sjatpLBMbsY4jIt0SsRlWPpDI3QfLgs3kgRJzLLDECs@soMrZuYICT1EnjxOq4cnj/UKVvxBFm7bIHw" rel="nofollow noreferrer" title="Factor – Try It Online">Try it online!</a></p>
<pre><code>  [0,b]                      ! range from 0 to input inclusive
        [          ] map     ! map over each element in the range
          n!                 ! factorial
             dup ^           ! raised to itself
                         Σ   ! sum
</code></pre>


<h1>Ultrafactorials</h1>
<p>The ultrafactorials are a sequence of numbers which can be generated using the following function:</p>
<p><span class="math-container">$$a(n) = n! ^ {n!}$$</span></p>
<p>The resulting values rise extremely quickly.
<em>Side note: This is entry <a href="https://oeis.org/A046882" rel="nofollow noreferrer">A046882</a> in the OEIS. Also related are the hyperfactorials, a still quite huge, but a bit smaller sequence: <a href="https://oeis.org/A002109" rel="nofollow noreferrer">A002109</a></em></p>
<h1>Your task</h1>
<p>Your task is to implement these numbers into your language. Your program will calculate the <strong>sum of all ultrafactorials</strong> from 0 up to <em>inclusive</em> <code>n</code>.</p>
<h2>Input</h2>
<p>Your program may only take one input: a number, which resembles the last <span class="math-container">\$a(n)\$</span> ultrafactorial to be added to the sum. The Input is assured to be positive or 0.</p>
<h2>Output</h2>
<p>Your output is all up to you, as long as there's the visible sum of the numbers somewhere.</p>
<h2>Rules</h2>
<ul>
<li>You can assume all integers, therefore integer input, and using integer counting loops to produce some results.</li>
</ul>
<h2>Test cases</h2>
<pre><code>Input: -1
Output: Any kind of error (because -1! is undefined), or no handling at all

Input: 0
Output: 1

Input: 1
Output: 2

Input: 2
Output: 6

Input: 3
Output: 46662</code></pre>
<h1>Challenge</h1>
<p>This is <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" rel="tag">code-golf</a>, so the answer with the least length in bytes wins!</p>


Big numbers: Ultrafactorials

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

EdgeOne AI 安全实战专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

Ultrafactorials超阶乘是可以使用以下函数生成的一系列数字：a(n) = n! ^ {n!}由此产生的数值上升得非常快。备注:这是OEIS中的条目A046882。与此相关的还有超因式反应，这是一个相当大的序列，但相对较小：A002109。您的任务您的任务是将这些数字实现为您的语言。您的程序将计算从0到包含n的所有超因子之和。输入您的程序可能只需要一个输入:一个数字，它类似于要添加到和中

问大数字:超因子
EN

Ultrafactorials

您的任务

输入

输出

规则

测试用例

挑战

回答 29

Code Golf用户

05AB1E，5字节

Code Golf用户

Mathematica，19字节

Code Golf用户

果冻，6字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问大数字:超因子EN

Ultrafactorials

您的任务

输入

输出

规则

测试用例

挑战

回答 29

Code Golf用户

05AB1E，5字节

Code Golf用户

Mathematica，19字节

Code Golf用户

果冻，6字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问大数字:超因子
EN