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.

A058888 Number of terms in the set invphi(2*prime(n)), where prime(n) is the n-th prime.

Original entry on oeis.org

4, 4, 2, 0, 2, 0, 0, 0, 2, 2, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Labos Elemer, Jan 08 2001

Keywords

Examples

			The set invphi(2*3) = {7,9,14,18}. It has 4 terms, so a(2) = 4, while invphi(2*1601) = {3203,6406}, thus a(252) = 2.
		

Crossrefs

Programs

  • Maple
    with(numtheory): [seq(nops(invphi(2*ithprime(i))),i=1..256)];
  • PARI
    a(n) = invphiNum(2*prime(n)); \\ Amiram Eldar, Nov 07 2024, using Max Alekseyev's invphi.gp

Extensions

Offset corrected by Donovan Johnson, Apr 28 2013