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.

A213153 Polylogarithm li(-n,-8/9) multiplied by (17^(n+1))/9.

Original entry on oeis.org

1, -8, -8, 1144, 4600, -650888, -5610248, 782393464, 11721120760, -1604217628808, -37345505230088, 4993399538404984, 168423884058659320, -21890458098275195528, -1020495088251266584328
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=8,q=9.

Examples

			polylog(-5,-8/9)*17^6/9 = -650888.
		

Crossrefs

Programs

  • Mathematica
    p = 8; q = 9; 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 *)
  • PARI
    in A212846; run limnpq(nmax, 8, 9)

Formula

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