The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112415 a(n) = C(1+n,1) * C(2+n,1) * C(4+n,2). 2
 12, 60, 180, 420, 840, 1512, 2520, 3960, 5940, 8580, 12012, 16380, 21840, 28560, 36720, 46512, 58140, 71820, 87780, 106260, 127512, 151800, 179400, 210600, 245700, 285012, 328860, 377580, 431520 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..680 Index entries for linear recurrences with constant coefficients, signature (5, -10, 10, -5, 1). FORMULA From R. J. Mathar, Aug 15 2008: (Start) a(n) = (n+1)*(n+2)*(n+3)*(n+4)/2 = A033486(n+1) = 12*A000332(n+4). O.g.f.: 12/(1-x)^5. (End) From a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5); a(0)=12, a(1)=60, a(2)=180, a(3)=420, a(4)=840. - Harvey P. Dale, Jul 24 2011 EXAMPLE n=0: C(1+0,1)*C(2+0,1)*C(4+0,2) = C(1,1)*C(2,1)*C(4,2) = 1*2*6 = 12; n=10: C(1+10,1)*C(2+10,1)*C(4+10,2) = C(11,1)*C(12,1)*C(14,2) = 11*12*91 = 12012. MATHEMATICA Table[(n+1)(n+2)Binomial[4+n, 2], {n, 0, 30}] (* or *) LinearRecurrence[ {5, -10, 10, -5, 1}, {12, 60, 180, 420, 840}, 31] (* Harvey P. Dale, Jul 24 2011 *) PROG (MAGMA) [(n+1)*(n+2)*(n+3)*(n+4)/2: n in [0..40]]; // Vincenzo Librandi, Apr 28 2011 CROSSREFS Sequence in context: A332544 A279509 A008530 * A033486 A174642 A061624 Adjacent sequences:  A112412 A112413 A112414 * A112416 A112417 A112418 KEYWORD easy,nonn AUTHOR Zerinvary Lajos, Dec 09 2005 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 April 16 04:49 EDT 2021. Contains 343030 sequences. (Running on oeis4.)