A113776 - OEIS

A113776

Let S(m, n):=Sum_{k=1..n} k^m; 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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

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

LINKS

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

Cf. A103438 (S(m, n)).

See A115242 for iterated increasing power sums.

KEYWORD

nonn

AUTHOR

EXTENSIONS

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

STATUS

approved