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 A213141 #12 Jul 26 2025 14:38:11 %S A213141 1,-3,-21,33,4011,46617,-1015581,-48942687,-234562629,46778432937, %T A213141 1609014050259,-27879344558607,-4096322988867669,-82334747816721543, %U A213141 7943345993936306499,587663560859820510273 %N A213141 Polylogarithm li(-n,-3/10) multiplied by (13^(n+1))/10. %C A213141 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=3,q=10. %H A213141 Stanislav Sykora, <a href="/A213141/b213141.txt">Table of n, a(n) for n = 0..100</a> %F A213141 See formula in A212846, setting p=3,q=10. %e A213141 polylog(-5,-3/10)*13^6/10 = 46617. %t A213141 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 A213141 (PARI) \\ in A212846; run limnpq(nmax, 3, 10) %Y A213141 Cf. A212846, A210246, A212847, A213127 to A213140. %Y A213141 Cf. A213142 to A213157. %K A213141 sign %O A213141 0,2 %A A213141 _Stanislav Sykora_, Jun 06 2012