This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A050542 Iterated triangular numbers. 9
 5, 15, 120, 7260, 26357430, 347357071281165, 60328467484514345085777519195, 1819761994515052295911016533077539330911500847167185483610 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..11 FORMULA a(n) = binomial(a(n-1)+1, 2), a(0)=5. a(n) ~ 2 * c^(2^n), where c = 2.786070277619247476352890606543375642991890742669788965024... . - Vaclav Kotesovec, Dec 17 2014 MATHEMATICA a=5; lst={a}; Do[b=(a+1)*a/2; AppendTo[lst, b]; a=b, {n, 1, 9}]; lst ( Vladimir Joseph Stephan Orlovsky, Mar 16 2010 *) NestList[Binomial[#+1, 2]&, 5, 9] (* Harvey P. Dale, Sep 24 2011 *) PROG (Haskell) a050542 n = a050542_list !! n a050542_list = iterate a000217 5  -- Reinhard Zumkeller, Apr 10 2014 (PARI) a(n)=if(n, binomial(a(n-1)+1, 2), 5) \\ Charles R Greathouse IV, Feb 08 2017 CROSSREFS Cf. A000217, A007501, A013589, A050536, A050548, A050909. Sequence in context: A303230 A173736 A244298 * A091096 A116957 A124209 Adjacent sequences:  A050539 A050540 A050541 * A050543 A050544 A050545 KEYWORD easy,nice,nonn AUTHOR Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 29 1999 STATUS approved

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

Last modified December 13 03:41 EST 2019. Contains 329968 sequences. (Running on oeis4.)