login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213136 Polylogarithm li(-n,-2/9) multiplied by (11^(n+1))/9. 3

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 21:46 EDT 2024. Contains 371781 sequences. (Running on oeis4.)