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.

Showing 1-2 of 2 results.

A213154 Polylogarithm li(-n,-9/10) multiplied by (19^(n+1))/10.

Original entry on oeis.org

1, -9, -9, 1611, 6471, -1148589, -9872289, 1732196331, 25810293591, -4461906502269, -102948316013169, 17472999720383451, 581452715402943111, -96525920129033025549, -4413961128482041139649
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=9,q=10.

Examples

			polylog(-5,-9/10)*19^6/10 = -1148589.
		

Crossrefs

Programs

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

Formula

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

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.
Showing 1-2 of 2 results.