login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A115242
Sequence of iterated increasing power sums. These sums are a generalization of iterated triangle sums.
1
1, 15, 131325321, 210449029945495266124836624698709415244045199778210143675
OFFSET
1,2
COMMENTS
These are iterated increasing power sums. These sums are a generalization of iterated triangle sums.
FORMULA
Let S(m, n) = Sum_{k=1...n} k^m; we define a(1):=S(1, 1), a(2):=S(1, S(2, 2)) etc., a(n):=S(1, S(2, S(3, ...S(n, n))...))).
EXAMPLE
a(1) = S(1,1) = 1.
a(2) = S(1,S(2,2)) = S(1,5) = 15.
a(3) = S(1,S(2,S(3,3))) = S(1,S(2,36)) = S(1,16206) = 131325321.
CROSSREFS
See A113776 for iterated decreasing power sums.
Sequence in context: A084878 A013874 A068252 * A296528 A072723 A111413
KEYWORD
nonn
AUTHOR
Hieronymus Fischer, Jan 19 2006
STATUS
approved