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.

A213149 Polylogarithm li(-n,-6/7) multiplied by (13^(n+1))/7.

Original entry on oeis.org

1, -6, -6, 498, 2010, -163806, -1426326, 113319858, 1731433530, -133040247486, -3200805321846, 235719742497618, 8363215587567450, -584103976037953566, -29313609779751086166, 1917198413998763777778
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=6,q=7.

Examples

			polylog(-5,-6/7)*13^6/7 = -163806.
		

Crossrefs

Programs

  • Mathematica
    p = 6; q = 7; 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, 6, 7)

Formula

See formula in A212846, setting p=6,q=7.