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.

A213156 Polylogarithm li(-n,-1/1000) multiplied by (1001^(n+1))/1000.

Original entry on oeis.org

1, -1, -999, -996001, -989010999, -974065974001, -943301698056999, -881188585190880001, -757277396614707246999, -512519922101780607498001, -34386117044101144161012999
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=1,q=1000.

Examples

			polylog(-5,-1/1000)*1001^6/1000 = -974065974001.
		

Crossrefs

Programs

  • PARI
    in A212846; run limnpq(nmax, 1, 1000)

Formula

See formula in A212846, setting p=1, q=1000.