0,2

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

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))...))).

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.

See A115242 for iterated increasing power sums.

Sequence in context: A010930 A022609 A060217 this_sequence A101383 A044265 A044646

Adjacent sequences: A113773 A113774 A113775 this_sequence A113777 A113778 A113779

nonn

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 19 2006