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.

A213156 Polylogarithm li(-n,-1/1000) multiplied by (1001^(n+1))/1000.

This page as a plain text file.
%I A213156 #8 Dec 21 2015 04:17:40
%S A213156 1,-1,-999,-996001,-989010999,-974065974001,-943301698056999,
%T A213156 -881188585190880001,-757277396614707246999,-512519922101780607498001,
%U A213156 -34386117044101144161012999
%N A213156 Polylogarithm li(-n,-1/1000) multiplied by (1001^(n+1))/1000.
%C A213156 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=1,q=1000.
%H A213156 Stanislav Sykora, <a href="/A213156/b213156.txt">Table of n, a(n) for n = 0..100</a>
%F A213156 See formula in A212846, setting p=1, q=1000.
%e A213156 polylog(-5,-1/1000)*1001^6/1000 = -974065974001.
%o A213156 (PARI) in A212846; run limnpq(nmax, 1, 1000)
%Y A213156 Cf. A212846, A210246, A212847, A213127-A213155, A213157.
%K A213156 sign
%O A213156 0,3
%A A213156 _Stanislav Sykora_, Jun 06 2012