cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A213152 Polylogarithm li(-n,-7/10) multiplied by (17^(n+1))/10.

This page as a plain text file.
%I A213152 #9 Dec 26 2015 02:08:12
%S A213152 1,-7,-21,917,11571,-452347,-13308141,435327557,25765086291,
%T A213152 -624624700987,-74611975175661,990632591644997,299140108182963411,
%U A213152 249897499717445573,-1569672873030414985581,-30079222140754781400763
%N A213152 Polylogarithm li(-n,-7/10) multiplied by (17^(n+1))/10.
%C A213152 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=7,q=10.
%H A213152 Stanislav Sykora, <a href="/A213152/b213152.txt">Table of n, a(n) for n = 0..100</a>
%F A213152 See formula in A212846, setting p=7,q=10.
%e A213152 polylog(-5,-7/10)*17^6/10 = -452347.
%t A213152 p = 7; q = 10; f[n_] := PolyLog[-n, -p/q] (p + q)^(n + 1)/q; f[0] = 1; Array[f, 20, 0] (* _Robert G. Wilson v_, Dec 25 2015 *)
%o A213152 (PARI) in A212846; run limnpq(nmax, 7, 10)
%Y A213152 Cf. A212846, A210246, A212847, A213127 to A213151.
%Y A213152 Cf. A213153 to A213157.
%K A213152 sign
%O A213152 0,2
%A A213152 _Stanislav Sykora_, Jun 06 2012