This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213132 Polylogarithm li(-n,-1/9) multiplied by (10^(n+1))/9. 3
 1, -1, -8, -46, 64, 7280, 118720, 406160, -35578880, -1156775680, -12796467200, 444964083200, 27457634713600, 594958346547200, -9096689344716800, -1258068242084608000, -45330583283597312000, 24150498582339584000, 95678058298287259648000, 5379182782796767182848000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=1,q=9. LINKS Stanislav Sykora, Table of n, a(n) for n = 0..100 OEIS-Wiki, Eulerian polynomials FORMULA See formula in A212846, setting p=1,q=9 E.g.f.: 10/(9+exp(10*x)). [Joerg Arndt, Apr 21 2013] EXAMPLE polylog(-5, -1/9)*10^6/9 = 7280 MAPLE seq(add((-1)^(n-k)*combinat[eulerian1](n, k)*9^k, k=0..n), n=0..17); # Peter Luschny, Apr 21 2013 PROG (PARI) /* See A212846; run limnpq(nmax, 1, 9) */ (PARI) x='x+O('x^66); Vec(serlaplace( 10/(9+exp(10*x)) )) \\ Joerg Arndt, Apr 21 2013 CROSSREFS Cf. A212846, A210246, A212847, A213127 to A213131 Cf. A213133 to A213157 Sequence in context: A306047 A110348 A296945 * A137390 A190048 A034469 Adjacent sequences:  A213129 A213130 A213131 * A213133 A213134 A213135 KEYWORD sign AUTHOR Stanislav Sykora, Jun 06 2012 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 December 16 07:12 EST 2018. Contains 318158 sequences. (Running on oeis4.)