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.

A213143 Polylogarithm li(-n,-4/7) multiplied by (11^(n+1))/7.

This page as a plain text file.
%I A213143 #12 Jul 26 2025 14:38:02
%S A213143 1,-4,-12,188,2580,-28324,-1123212,4593788,791677140,4687508636,
%T A213143 -789960600012,-16633684281412,997739785828500,46516458962719196,
%U A213143 -1370408093916825612,-140930266128553137412
%N A213143 Polylogarithm li(-n,-4/7) multiplied by (11^(n+1))/7.
%C A213143 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=4,q=7.
%H A213143 Stanislav Sykora, <a href="/A213143/b213143.txt">Table of n, a(n) for n = 0..100</a>
%F A213143 See formula in A212846, setting p=4,q=7.
%e A213143 polylog(-5,-4/7)*11^6/7 = -28324.
%t A213143 f[n_] := PolyLog[-n, -4/7] 11^(n + 1)/7; f[0] = 1; Array[f, 20, 0] (* _Robert G. Wilson v_, Dec 25 2015 *)
%o A213143 (PARI) \\ in A212846; run limnpq(nmax, 4, 7)
%Y A213143 Cf. A212846, A210246, A212847, A213127 to A213142.
%Y A213143 Cf. A213144 to A213157.
%K A213143 sign
%O A213143 0,2
%A A213143 _Stanislav Sykora_, Jun 06 2012