login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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
See A115242 for iterated increasing power sums.
Sequence in context: A220892 A022609 A060217 * A202901 A224328 A241396
KEYWORD
nonn
AUTHOR
Hieronymus Fischer, Jan 19 2006
EXTENSIONS
Edited by N. J. A. Sloane, Jun 15 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)