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.

A145337 a(n) = d(p(n)+1) - d(p(n)-1), where d(m) = the number of divisors of m, p(n) = the n-th prime.

Original entry on oeis.org

1, 1, 1, 0, 2, -2, 1, 0, 4, 2, -2, -5, 0, -2, 6, 2, 8, -8, -2, 4, -8, 2, 8, 4, -6, -1, 0, 8, -4, -2, -4, 4, 0, 4, 6, -4, -8, -4, 12, 2, 14, -10, 6, -10, 3, 0, -10, 4, 8, -4, 4, 12, -14, 10, -1, 12, 10, -6, -8, -8, -2, 6, 0, 8, -12, 2, -10, -14, 8, 0, -4, 20, 2, -4, -4, 12, 10, -14, -7, -8
Offset: 0

Views

Author

Leroy Quet, Oct 08 2008

Keywords

Crossrefs

Programs

Formula

a(n) = A008329(n) - A008328(n). - R. J. Mathar, Oct 10 2008

Extensions

More terms from R. J. Mathar and Ray Chandler, Oct 10 2008