Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)
A115242 Sequence of iterated increasing power sums. These sums are a generalization of iterated triangle sums. 1
1, 15, 131325321, 210449029945495266124836624698709415244045199778210143675 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
These are iterated increasing power sums. These sums are a generalization of iterated triangle sums.
LINKS
FORMULA
Let S(m, n) = Sum_{k=1...n} k^m; we define a(1):=S(1, 1), a(2):=S(1, S(2, 2)) etc., a(n):=S(1, S(2, S(3, ...S(n, n))...))).
EXAMPLE
a(1) = S(1,1)=1.
a(2) = S(1,S(2,2)) = S(1,5) = 15;
a(3) = S(1,S(2,S(3,3) = S(1,S(2,36) = S(1,16206) = 131325321.
CROSSREFS
See A115243 for iterated decreasing power sums.
Sequence in context: A084878 A013874 A068252 * A296528 A072723 A111413
KEYWORD
nonn
AUTHOR
Hieronymus Fischer, Jan 19 2006
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 August 18 10:08 EDT 2024. Contains 375264 sequences. (Running on oeis4.)