A113776 Let S(m, n):=sum{k^m: k=1...n}; we define a(1):=S(1, 1), a(2):=S(2, S(1, 2)) etc., a(n):=S(n, S(n-1, S(n-2, ...S(1, n))...))).

1, 14, 91, 17522596, 1026148893131813787580921710841512880680110612545

Offset

0,2

Comments

These are iterated decreasing power sums. They are in some way a generalization of iterated triangle sums.

Links

Table of n, a(n) for n=0..4.

Example

a(1)=S(1,1)=1; a(2)=S(2,S(1,2))=S(2,3)=14;
a(3)=S(3,S(2,S(1,3)))=S(3,S(2,6)=S(3,91)=17522596.

Crossrefs

See A115242 for iterated increasing power sums.

Sequence in context: A220892 A022609 A060217 * A202901 A224328 A241396

Adjacent sequences: A113773 A113774 A113775 * A113777 A113778 A113779

Keyword

nonn

Author

Hieronymus Fischer, Jan 19 2006

Extensions

Edited by N. J. A. Sloane, Jun 15 2009

Status

approved