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.

A213151 Polylogarithm li(-n,-7/9) multiplied by (16^(n+1))/9.

Original entry on oeis.org

1, -7, -14, 854, 7000, -405832, -7373744, 396878384, 13211201920, -640085041792, -35826474785024, 1495566369860864, 136414677606538240, -4577281372443415552, -691769416923579029504, 16372660554702059116544
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=7,q=9.

Examples

			polylog(-5,-7/9)*16^6/9 = -405832.
		

Crossrefs

Programs

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

Formula

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