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.

A029833 A discrete version of the Mangoldt function: if n is prime then round(log(n)) else 0.

Original entry on oeis.org

0, 1, 1, 0, 2, 0, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 3, 0, 3, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 4, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 5, 0, 5, 0, 0, 0, 5, 0, 5, 0, 0, 0, 5, 0, 0
Offset: 1

Views

Author

Keywords

Comments

The real Mangoldt function Lambda(n) is equal to log(n) if n is prime else 0.

References

  • T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 32.
  • P. Ribenboim, Algebraic Numbers, p. 44.

Crossrefs

Programs

Extensions

More terms from Antti Karttunen, Feb 06 2019