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!)
 A095177 E.g.f.: exp(x)/(1-x)^5. 11
 1, 6, 41, 316, 2721, 25946, 271801, 3105936, 38474561, 513796366, 7360674441, 112632827396, 1833790646881, 31656637715106, 577636838177561, 11109543835539736, 224635867973671041, 4764236394052127126 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Sum_{k = 0..n} A094816(n,k)*x^k give A000522(n), A001339(n), A082030(n), A095000(n) for x = 1, 2, 3, 4 respectively. From Peter Bala, Jul 10 2008: (Start) a(n) is a difference divisibility sequence, that is, the difference a(n) - a(m) is divisible by n - m for all n and m (provided n is not equal to m). See A000522 for further properties of difference divisibility sequences. Recurrence relation: a(0) = 1, a(1) = 6, a(n) = (n+5)*a(n-1) - (n-1)*a(n-2) for n >= 2. Let p_4(n) = n^4+2*n^3+5*n^2+1 = n^(4)-4*n^(3)+6*n^(2)-4*n^(1)+1, where n^(k) denotes the rising factorial n*(n+1)*...*(n+k-1). The polynomial p_4(n) is an example of a Poisson-Charlier polynomial c_k(x;a) at k = 4, x = -n and a = -1. The sequence b(n) := n!*p_4(n+1) = A001688(n) satisfies the same recurrence as a(n) but with the initial conditions b(0) = 9, b(1) = 53. This leads to the finite continued fraction expansion expansion a(n)/b(n) = 1/(9-1/(6-1/(7-2/(8-...-(n-1)/(n+5))))). Lim n -> infinity a(n)/b(n) = e/24 = 1/(9-1/(6-1/(7-2/(8-...-n/((n+6)-...))))). a(n) = b(n) * sum {k = 0..n} 1/(k!*p_4(k)*p_4(k+1)) - since the rhs satisfies the above recurrence with the same initial conditions. Hence e = 24 * sum {k = 0..inf} 1/(k!*p_4(k)p_4(k+1)). For sequences satisfying the more general recurrence a(n) = (n+1+r)*a(n-1) - (n-1)*a(n-2), which yield series acceleration formulas for e/r! that involve the Poisson-Charlier polynomials c_r(-n;-1), refer to A000522 (r = 0), A001339 (r=1), A082030 (r=2), A095000 (r=3). (End) LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 Eric Weisstein's World of Mathematics, Poisson-Charlier polynomial FORMULA a(n) = Sum_{k = 0..n} A094816(n, k)*5^k. a(n) = Sum_{k=0..n} binomial(n, k)*(k+4)!/4!. G.f.: 1/Q(0), where Q(k) = 1 - x - x*(k+5)/(1 - x*(k+1)/Q(k+1)); (continued fraction). - Sergei N. Gladkovskii, Apr 22 2013 a(n) ~ n! *exp(1)*n^4/24. - Vaclav Kotesovec, Jun 21 2013 a(n) = 2F0(5,-n;;-1). - Benedict W. J. Irwin, May 27 2016 MATHEMATICA CoefficientList[Series[Exp[x]/(1-x)^5, {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Jun 21 2013 *) Table[HypergeometricPFQ[{5, -n}, {}, -1], {n, 0, 20}] (* Benedict W. J. Irwin, May 27 2016 *) PROG (PARI) a(n) = sum(k=0, n, binomial(n, k)*(k+4)!/4! ); \\ Joerg Arndt, Apr 22 2013 CROSSREFS Cf. A000522, A001339, A082030, A095000. Sequence in context: A100770 A084397 A024078 * A199553 A225031 A307663 Adjacent sequences:  A095174 A095175 A095176 * A095178 A095179 A095180 KEYWORD nonn AUTHOR Philippe Deléham, Jun 20 2004 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 September 22 16:33 EDT 2020. Contains 337291 sequences. (Running on oeis4.)