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.

A213136 Polylogarithm li(-n,-2/9) multiplied by (11^(n+1))/9.

Original entry on oeis.org

1, -2, -14, -26, 1330, 23638, -8414, -10070426, -215250350, 1947801718, 246368009986, 5254817440774, -152365259476430, -13578534513671402, -241920062298205214, 18542492740003377574, 1388279735908198531090
Offset: 0

Views

Author

Stanislav Sykora, Jun 06 2012

Keywords

Comments

See the sequence A212846 which describes the general case of li(-n,-p/q). This sequence is obtained for p=2,q=9.

Examples

			polylog(-5,-2/9)*11^6/9 = 23638.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := PolyLog[-n, -2/9] 11^(n + 1)/9; f[0] = 1; Array[f, 20, 0] (* Robert G. Wilson v, Dec 25 2015 *)
  • PARI
    in A212846; run limnpq(nmax, 2, 9)

Formula

See formula in A212846, setting p=2,q=9.