login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115410 Sequence of iterated sums of squares (1^2+2^2+3^2+...+n^2). 0
1, 55, 349074740, 7458911738724515315524082613205180, 159232823342755035454279356693126603659457648808279391910878167820461916066223383414616137125812767424153893199341493609630 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Can be understood as generalized iterated square pyramidal numbers. The growth of the sequence is bounded by O(n^3^n/3^(n/2)). This can be derived from the growth O(n^3/3) of the power two sum (1^2+2^2+3^2+...+n^2) by iteration.

FORMULA

Let T(n):=sum{k^2|k=1...n}; we define a(1):=T(1), a(2):=T(T(2)) etc., a(n):=T(T(T(...T(n))...))).

EXAMPLE

a(2)=T(T(2))=T(5)=55;

a(3)=T(T(T(3)))=T(T(14)=T(1015)=349074740.

CROSSREFS

Cf. A000330, A099129.

Sequence in context: A093255 A172896 A201823 * A172533 A036197 A107676

Adjacent sequences:  A115407 A115408 A115409 * A115411 A115412 A115413

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 23:08 EST 2012. Contains 206085 sequences.