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.

A213148 Polylogarithm li(-n,-5/9) multiplied by (14^(n+1))/9.

Original entry on oeis.org

1, -5, -20, 370, 6880, -84080, -4764320, 13835920, 5296238080, 57709630720, -8215749893120, -267412364065280, 15638020342497280, 1127961849051627520, -29166891598121553920, -5249813654826672404480
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=5,q=9.

Examples

			polylog(-5,-5/9)*14^6/9 = -84080.
		

Crossrefs

Programs

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

Formula

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

A213150 Polylogarithm li(-n,-7/8) multiplied by (15^(n+1))/8.

Original entry on oeis.org

1, -7, -7, 777, 3129, -342615, -2965095, 318612105, 4810567545, -504410403735, -11895756971175, 1209591806193225, 41613411780711225, -4074816146460117975, -195459943548067129575, 18284823353530418351625
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=8.

Examples

			polylog(-5,-7/8)*15^6/8 = -342615.
		

Crossrefs

Programs

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

Formula

See formula in A212846, setting p=7,q=8.
Showing 1-2 of 2 results.