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 A213133 #19 Dec 24 2024 22:13:47
%S A213133 1,-1,-9,-61,-9,9659,197631,1388099,-51302169,-2339721781,
%T A213133 -41290278129,536297904659,64956862241271,2152254297009179,
%U A213133 6320179650231711,-3288155212484644381,-187761119883430045689
%N A213133 Polylogarithm li(-n,-1/10) multiplied by (11^(n+1))/10.
%C A213133 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=1,q=10.
%H A213133 Stanislav Sykora, <a href="/A213133/b213133.txt">Table of n, a(n) for n = 0..100</a>
%F A213133 See formula in A212846, setting p=1,q=10.
%F A213133 a(n) = Sum_{k=0..n} k! * (-1)^k * 11^(n-k) * Stirling2(n,k). - _Seiichi Manyama_, Mar 13 2022
%e A213133 polylog(-5,-1/10)*11^6/10 = 9659.
%t A213133 f[n_] := PolyLog[-n, -1/10] 11^(n + 1)/10; f[0] = 1; Array[f, 20, 0] (* _Robert G. Wilson v_, Dec 25 2015 *)
%o A213133 (PARI) \\ in A212846; run limnpq(nmax, 1, 10)
%o A213133 (PARI) a(n) = sum(k=0, n, k!*(-1)^k*11^(n-k)*stirling(n, k, 2)); \\ _Seiichi Manyama_, Mar 13 2022
%Y A213133 Cf. A212846, A210246, A212847, A213127 to A213132.
%Y A213133 Cf. A213134 to A213157.
%K A213133 sign
%O A213133 0,3
%A A213133 _Stanislav Sykora_, Jun 06 2012