This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056126 a(n) = n*(n+17)/2. 17
 0, 9, 19, 30, 42, 55, 69, 84, 100, 117, 135, 154, 174, 195, 217, 240, 264, 289, 315, 342, 370, 399, 429, 460, 492, 525, 559, 594, 630, 667, 705, 744, 784, 825, 867, 910, 954, 999, 1045, 1092, 1140, 1189, 1239, 1290, 1342, 1395, 1449, 1504, 1560, 1617, 1675 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) = A126890(n,8) for n>7. - Reinhard Zumkeller, Dec 30 2006 LINKS Index entries for linear recurrences with constant coefficients, signature (3,-3,1). FORMULA G.f.: x*(9-8*x)/(1-x)^3. a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). If we define f(n,i,a) = sum_{k=0..n-i} binomial(n,k)*stirling1(n-k,i)*product_{j=0..k-1} (-a-j), then a(n) = -f(n,n-1,9), for n>=1. - Milan Janjic, Dec 20 2008 a(n) = a(n-1) + n + 8 (with a(0)=0). - Vincenzo Librandi, Aug 07 2010 a(n) = 9n - floor(n/2) + floor(n^2/2). - Wesley Ivan Hurt, Jun 15 2013 MATHEMATICA i=-8; s=0; lst={}; Do[s+=n+i; If[s>=0, AppendTo[lst, s]], {n, 0, 6!, 1}]; lst (* Vladimir Joseph Stephan Orlovsky, Oct 29 2008 *) Table[n(n+17)/2, {n, 0, 50}] (* Harvey P. Dale, Apr 25 2011 *) PROG (PARI) a(n)=n*(n+17)/2 \\ Charles R Greathouse IV, Sep 24 2015 CROSSREFS Cf. A056121, A000096, A051942, A056000, A001477, A098849, A120071, A132760, A132761, A132765. Sequence in context: A031499 A017377 A189798 * A190513 A190576 A250663 Adjacent sequences:  A056123 A056124 A056125 * A056127 A056128 A056129 KEYWORD easy,nonn AUTHOR Barry E. Williams, Jul 07 2000 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.