This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A132758 n(n+31)/2. 5
 0, 16, 33, 51, 70, 90, 111, 133, 156, 180, 205, 231, 258, 286, 315, 345, 376, 408, 441, 475, 510, 546, 583, 621, 660, 700, 741, 783, 826, 870, 915, 961, 1008, 1056, 1105, 1155, 1206, 1258, 1311, 1365, 1420, 1476, 1533, 1591, 1650 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA a(n) = n*(n+31)/2. If we define f(n,i,a)=sum(binomial(n,k)*stirling1(n-k,i)*product(-a-j,j=0..k-1),k=0..n-i), then a(n) = -f(n,n-1,16), for n>=1. [From Milan Janjic, Dec 20 2008] a(n)=n+a(n-1)+15 (with a(0)=0) [From Vincenzo Librandi, Aug 03 2010] a(0)=0, a(1)=16, a(2)=33, a(n)=3*a(n-1)-3*a(n-2)+a(n-3). - Harvey P. Dale, Jun 21 2012 EXAMPLE a(1)=1+0+15=16; a(2)=2+16+15=33; a(3)=3+33+15=51 [From Vincenzo Librandi, Aug 03 2010] MATHEMATICA Table[(n(n+31))/2, {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 16, 33}, 50] (* Harvey P. Dale, Jun 21 2012 *) CROSSREFS Cf. A000217, A056126. Sequence in context: A095784 A041502 A041500 * A195146 A198275 A041504 Adjacent sequences:  A132755 A132756 A132757 * A132759 A132760 A132761 KEYWORD easy,nonn AUTHOR Omar E. Pol, Aug 28 2007 STATUS approved

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 May 22 15:12 EDT 2013. Contains 225552 sequences.