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 A213140 #12 Jul 26 2025 14:38:15 %S A213140 1,-3,-15,69,2505,10077,-716415,-14740491,213018105,15676762317, %T A213140 98170027185,-17112616737051,-553855541534295,15477991707447357, %U A213140 1557738998240770785,10238839745149426389,-3849999044450765494695 %N A213140 Polylogarithm li(-n,-3/8) multiplied by (11^(n+1))/8. %C A213140 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=3,q=8. %H A213140 Stanislav Sykora, <a href="/A213140/b213140.txt">Table of n, a(n) for n = 0..100</a> %F A213140 See formula in A212846, setting p=3,q=8. %e A213140 polylog(-5,-3/8)*11^6/8 = 10077. %t A213140 f[n_] := PolyLog[-n, -3/8] 11^(n + 1)/8; f[0] = 1; Array[f, 20, 0] (* _Robert G. Wilson v_, Dec 25 2015 *) %o A213140 (PARI) \\ in A212846; run limnpq(nmax, 3, 8) %Y A213140 Cf. A212846, A210246, A212847, A213127 to A213139. %Y A213140 Cf. A213141 to A213157. %K A213140 sign %O A213140 0,2 %A A213140 _Stanislav Sykora_, Jun 06 2012