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 A213136 #9 Dec 26 2015 02:06:54 %S A213136 1,-2,-14,-26,1330,23638,-8414,-10070426,-215250350,1947801718, %T A213136 246368009986,5254817440774,-152365259476430,-13578534513671402, %U A213136 -241920062298205214,18542492740003377574,1388279735908198531090 %N A213136 Polylogarithm li(-n,-2/9) multiplied by (11^(n+1))/9. %C A213136 See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=2,q=9. %H A213136 Stanislav Sykora, <a href="/A213136/b213136.txt">Table of n, a(n) for n = 0..100</a> %F A213136 See formula in A212846, setting p=2,q=9. %e A213136 polylog(-5,-2/9)*11^6/9 = 23638. %t A213136 f[n_] := PolyLog[-n, -2/9] 11^(n + 1)/9; f[0] = 1; Array[f, 20, 0] (* _Robert G. Wilson v_, Dec 25 2015 *) %o A213136 (PARI) in A212846; run limnpq(nmax, 2, 9) %Y A213136 Cf. A212846, A210246, A212847, A213127 to A213135. %Y A213136 Cf. A213137 to A213157. %K A213136 sign %O A213136 0,2 %A A213136 _Stanislav Sykora_, Jun 06 2012