|
|
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))...))).
|
|
0
|
|
|
|
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
|
See A115242 for iterated increasing power sums.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|