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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Dec 26 2015 02:06:54
%S 1,-2,-14,-26,1330,23638,-8414,-10070426,-215250350,1947801718,
%T 246368009986,5254817440774,-152365259476430,-13578534513671402,
%U -241920062298205214,18542492740003377574,1388279735908198531090
%N Polylogarithm li(-n,-2/9) multiplied by (11^(n+1))/9.
%C See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=2,q=9.
%H Stanislav Sykora, <a href="/A213136/b213136.txt">Table of n, a(n) for n = 0..100</a>
%F See formula in A212846, setting p=2,q=9.
%e polylog(-5,-2/9)*11^6/9 = 23638.
%t f[n_] := PolyLog[-n, -2/9] 11^(n + 1)/9; f[0] = 1; Array[f, 20, 0] (* _Robert G. Wilson v_, Dec 25 2015 *)
%o (PARI) in A212846; run limnpq(nmax, 2, 9)
%Y Cf. A212846, A210246, A212847, A213127 to A213135.
%Y Cf. A213137 to A213157.
%K sign
%O 0,2
%A _Stanislav Sykora_, Jun 06 2012