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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050536 Iterated triangular numbers. 10
8, 36, 666, 222111, 24666759216, 304224505122393846936, 46276274758482720006792605816457695217516, 1070746802761292462947634762387664148872006333922794021004562705432032738124213886 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10

FORMULA

a(n) = binomial(a(n-1)+1, 2), a(0)=8.

a(n) ~ 2 * c^(2^n), where c = 4.2726038862497240421168669075178596377687659229240586312... . - Vaclav Kotesovec, Dec 17 2014

MATHEMATICA

NestList[Binomial[#+1, 2]&, 8, 7] (* Harvey P. Dale, Jan 22 2016 *)

PROG

(Haskell)

a050536 n = a050536_list !! n

a050536_list = iterate a000217 8 -- Reinhard Zumkeller, Apr 10 2014

(PARI) a(n)=if(n==0, 8, (a(n-1))*(a(n-1)+1)/2) \\ Edward Jiang, Sep 07 2014

CROSSREFS

Cf. A000217.

Cf. A007501, A013589, A050542, A050548, A050909.

Sequence in context: A268157 A203020 A276175 * A261846 A110215 A281465

Adjacent sequences: A050533 A050534 A050535 * A050537 A050538 A050539

KEYWORD

easy,nice,nonn

AUTHOR

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 29 1999

EXTENSIONS

One more term (a(7)) from Harvey P. Dale, Jan 22 2016

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 December 7 04:29 EST 2022. Contains 358649 sequences. (Running on oeis4.)