cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 1, 3, 5, 11, 18, 72, 387, 134349386, 115792089237316195423570985008687907853269984665640566457309223244801371506483
Offset: 0

Views

Author

Alois P. Heinz, Mar 15 2019

Keywords

Comments

a(10) has 40403562 decimal digits.

Examples

			a(0) = 1 because the empty partition () has no parts, the exponentiation operator ^ is right-associative, and 1 is the right identity of exponentiation.
a(6) = 1^1^1^1^1^1 + 1^1^1^1^2 + 1^1^2^2 + 2^2^2 + 1^1^1^3 + 1^2^3 + 3^3 + 1^1^4 + 2^4 + 1^5 + 6 = 1 + 1 + 1 + 16 + 1 + 1 + 27 + 1 + 16 + 1 + 6 = 72.
		

Crossrefs

Programs

  • Maple
    f:= l-> `if`(l=[], 1, l[1]^f(subsop(1=(), l))):
    a:= n-> add(f(sort(l, `<`)), l=combinat[partition](n)):
    seq(a(n), n=0..9);