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.

A213145 Polylogarithm li(-n,-5/6) multiplied by (11^(n+1))/6.

This page as a plain text file.
%I A213145 #12 Jul 26 2025 14:37:53
%S A213145 1,-5,-5,295,1195,-68705,-604205,33497095,521891995,-27561957905,
%T A213145 -685542701405,33989796735895,1270896506674795,-58096477696175105,
%U A213145 -3155667333487086605,129898710835267046695
%N A213145 Polylogarithm li(-n,-5/6) multiplied by (11^(n+1))/6.
%C A213145 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=5,q=6.
%H A213145 Stanislav Sykora, <a href="/A213145/b213145.txt">Table of n, a(n) for n = 0..100</a>
%F A213145 See formula in A212846, setting p=5,q=6.
%e A213145 polylog(-5,-5/6)*11^6/6 = -68705.
%t A213145 p = 5; q = 6; 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 A213145 (PARI) \\ in A212846; run limnpq(nmax, 5, 6)
%Y A213145 Cf. A212846, A210246, A212847, A213127 to A213144.
%Y A213145 Cf. A213146 to A213157.
%K A213145 sign
%O A213145 0,2
%A A213145 _Stanislav Sykora_, Jun 06 2012