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!)
A213141 Polylogarithm li(-n,-3/10) multiplied by (13^(n+1))/10. 3

%I #9 Dec 26 2015 02:10:51

%S 1,-3,-21,33,4011,46617,-1015581,-48942687,-234562629,46778432937,

%T 1609014050259,-27879344558607,-4096322988867669,-82334747816721543,

%U 7943345993936306499,587663560859820510273

%N Polylogarithm li(-n,-3/10) multiplied by (13^(n+1))/10.

%C See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=3,q=10.

%H Stanislav Sykora, <a href="/A213141/b213141.txt">Table of n, a(n) for n = 0..100</a>

%F See formula in A212846, setting p=3,q=10.

%e polylog(-5,-3/10)*13^6/10 = 46617.

%t f[n_] := PolyLog[-n, -3/10] 13^(n + 1)/10; f[0] = 1; Array[f, 20, 0] (* _Robert G. Wilson v_, Dec 25 2015 *)

%o (PARI) in A212846; run limnpq(nmax, 3, 10)

%Y Cf. A212846, A210246, A212847, A213127 to A213140.

%Y Cf. A213142 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 March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)