cp's OEIS Frontend

A213131 Polylogarithm li(-n,-1/8) multiplied by (9^(n+1))/8.

%I A213131 #22 Mar 13 2022 11:15:12
%S A213131 1,-1,-7,-33,105,5199,64953,-46593,-21769335,-497664081,-1941272487,
%T A213131 256114020447,9566995408425,99966666676239,-6245895772363527,
%U A213131 -366865939437422913,-6924777575908002615,259022993102904450159,24387711970312991335833,716398360186298080983327
%N A213131 Polylogarithm li(-n,-1/8) multiplied by (9^(n+1))/8.
%C A213131 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=1,q=8.
%H A213131 Stanislav Sykora, <a href="/A213131/b213131.txt">Table of n, a(n) for n = 0..100</a>
%H A213131 OEIS-Wiki, <a href="http://oeis.org/wiki/Eulerian_polynomials">Eulerian polynomials</a>
%F A213131 See formula in A212846, setting p=1,q=8.
%F A213131 E.g.f.: 9/(8+exp(9*x)). [_Joerg Arndt_, Apr 21 2013]
%F A213131 a(n) = Sum_{k=0..n} k! * (-1)^k * 9^(n-k) * Stirling2(n,k). - _Seiichi Manyama_, Mar 13 2022
%e A213131 polylog(-5,-1/8)*9^6/8 = 5199.
%p A213131 seq(add((-1)^(n-k)*combinat[eulerian1](n,k)*8^k, k=0..n),n=0..17); # _Peter Luschny_, Apr 21 2013
%t A213131 Table[If[n == 0, 1, PolyLog[-n, -1/8] 9^(n+1)/8], {n, 0, 19}] (* _Jean-François Alcover_, Jun 27 2019 *)
%o A213131 (PARI) /* See A212846; run limnpq(nmax, 1, 8) */
%o A213131 (PARI) x='x+O('x^66); Vec(serlaplace( 9/(8+exp(9*x)) )) \\ _Joerg Arndt_, Apr 21 2013
%o A213131 (PARI) a(n) = sum(k=0, n, k!*(-1)^k*9^(n-k)*stirling(n, k, 2)); \\ _Seiichi Manyama_, Mar 13 2022
%Y A213131 Cf. A212846, A210246, A212847, A213127 to A213130
%Y A213131 Cf. A213132 to A213157
%K A213131 sign
%O A213131 0,3
%A A213131 _Stanislav Sykora_, Jun 06 2012