login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306884 Sum over all partitions of n of the power tower evaluation x^y^...^z, where x, y, ..., z are the parts in (weakly) decreasing order. 5

%I #21 Mar 18 2019 09:40:10

%S 1,1,3,6,14,28,93,270,86170,7625640881546

%N Sum over all partitions of n of the power tower evaluation x^y^...^z, where x, y, ..., z are the parts in (weakly) decreasing order.

%C a(10) = 200352993...611306920 has 19729 decimal digits.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PowerTower.html">Power Tower</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Exponentiation">Exponentiation</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Identity_element">Identity element</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Operator_associativity">Operator associativity</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_(number_theory)">Partition (number theory)</a>

%e a(0) = 1 because the empty partition () has no parts, the exponentiation operator ^ is right-associative, and 1 is the right identity of exponentiation.

%e a(6) = 1^1^1^1^1^1 + 2^1^1^1^1 + 2^2^1^1 + 2^2^2 + 3^1^1^1 + 3^2^1 + 3^3 + 4^1^1 + 4^2 + 5^1 + 6 = 1 + 2 + 4 + 16 + 3 + 9 + 27 + 4 + 16 + 5 + 6 = 93.

%p f:= l-> `if`(l=[], 1, l[1]^f(subsop(1=(), l))):

%p a:= n-> add(f(sort(l, `>`)), l=combinat[partition](n)):

%p seq(a(n), n=0..9);

%Y Cf. A006906, A066186, A306895, A306901, A306902, A306903, A306918.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Mar 15 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)