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!)
 A004997 a(n) = (6^n/n!) * Product_{k=0..n-1} (6*k + 7). 1
 1, 42, 1638, 62244, 2334150, 86830380, 3212724060, 118411829640, 4351634739270, 159559940439900, 5839893820100340, 213421574152757880, 7789887456575662620, 284031281108989544760, 10346853811827476273400, 376625478750520136351760, 13699751789550169959795270 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..635 FORMULA G.f.: (1 - 36*x)^(-7/6). a(n) ~ 6*Gamma(1/6)^-1*n^(1/6)*6^(2*n)*(1 + (7/72)*n^-1 - ...). - Joe Keane (jgk(AT)jgk.org), Nov 24 2001 D-finite with recurrence: n*a(n) +6*(-6*n-1)*a(n-1)=0. - R. J. Mathar, Jan 17 2020 MAPLE a:= n-> (6^n/n!)*mul(6*k+7, k=0..n-1); seq(a(n), n=0..20); # G. C. Greubel, Aug 22 2019 MATHEMATICA Table[6^(2*n)*Pochhammer[7/6, n]/n!, {n, 0, 20}] (* G. C. Greubel, Aug 22 2019 *) PROG (PARI) a(n) = 6^n*prod(k=0, n-1, 6*k+7)/n!; vector(20, n, a(n-1)) \\ G. C. Greubel, Aug 22 2019 (MAGMA) [1] cat [6^n*&*[6*k+7: k in [0..n-1]]/Factorial(n): n in [1..20]]; // G. C. Greubel, Aug 22 2019 (Sage) [6^(2*n)*rising_factorial(7/6, n)/factorial(n) for n in (0..20)] # G. C. Greubel, Aug 22 2019 (GAP) List([0..20], n-> 6^n*Product([0..n-1], k-> 6*k+7)/Factorial(n) ); # G. C. Greubel, Aug 22 2019 CROSSREFS Sequence in context: A270410 A000502 A215545 * A120815 A162879 A163225 Adjacent sequences:  A004994 A004995 A004996 * A004998 A004999 A005000 KEYWORD nonn,easy AUTHOR Joe Keane (jgk(AT)jgk.org) 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 5 16:53 EDT 2020. Contains 333245 sequences. (Running on oeis4.)