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.
%I A213155 #9 Dec 26 2015 02:10:32 %S A213155 1,-1,-99,-9601,-891099,-74657401,-4598985699,83304101999, %T A213155 105616323905301,26458809087970199,4788219040686298701, %U A213155 620396956870561833599,15434896384804497301701,-25743663357271554846442201 %N A213155 Polylogarithm li(-n,-1/100) multiplied by (101^(n+1))/100. %C A213155 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=1,q=100. %H A213155 Stanislav Sykora, <a href="/A213155/b213155.txt">Table of n, a(n) for n = 0..100</a> %F A213155 See formula in A212846, setting p=1,q=100. %e A213155 polylog(-5,-1/100)*101^6/100 = -74657401. %t A213155 f[n_] := PolyLog[-n, -1/100] (101^(n + 1))/100; f[0] = 1; Array[f, 14, 0] (* _Robert G. Wilson v_, Dec 25 2015 *) %o A213155 (PARI) in A212846; run limnpq(nmax, 1, 100) %Y A213155 Cf. A212846, A210246, A212847, A213127 to A213154. %Y A213155 Cf. A213156, A213157. %K A213155 sign %O A213155 0,3 %A A213155 _Stanislav Sykora_, Jun 06 2012