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

 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!)
 A051604 a(n) = (3*n+4)!!!/4!!! 9
 1, 7, 70, 910, 14560, 276640, 6086080, 152152000, 4260256000, 132067936000, 4490309824000, 166141463488000, 6645658539520000, 285763317199360000, 13145112591170560000, 644110516967357440000, 33493746882302586880000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Related to A007559(n+1) ((3*n+1)!!! triple factorials). Row m=4 of the array A(4; m,n) := ((3*n+m)(!^3))/m(!^3), m >= 0, n >= 0. LINKS G. C. Greubel, Table of n, a(n) for n = 0..378 FORMULA a(n) = ((3*n+4)(!^3))/4(!^3). E.g.f.: 1/(1-3*x)^(7/3). MATHEMATICA With[{nn = 30}, CoefficientList[Series[1/(1-3*x)^(7/3), {x, 0, nn}], x]* Range[0, nn]! ] (* G. C. Greubel, Aug 15 2018 *) PROG (PARI) x='x+O('x^30); Vec(serlaplace(1/(1-3*x)^(7/3))) \\ G. C. Greubel, Aug 15 2018 (Magma) m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(1/(1-3*x)^(7/3))); [Factorial(n-1)*b[n]: n in [1..m]]; // G. C. Greubel, Aug 15 2018 CROSSREFS Cf. A032031, A007559(n+1), A034000(n+1), A034001(n+1). (rows m=0..3). Sequence in context: A124566 A141151 A001669 * A346668 A097630 A090647 Adjacent sequences: A051601 A051602 A051603 * A051605 A051606 A051607 KEYWORD easy,nonn AUTHOR 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.

Last modified November 26 20:01 EST 2022. Contains 358362 sequences. (Running on oeis4.)