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.

A071633 Number of terms in the set InvPhi(65536*prime(n)), where prime(n) is the n-th prime.

Original entry on oeis.org

19, 82, 59, 46, 56, 34, 26, 20, 31, 52, 10, 56, 24, 34, 0, 30, 20, 20, 32, 37, 32, 24, 30, 37, 34, 24, 2, 26, 16, 35, 22, 46, 15, 20, 38, 14, 20, 58, 11, 22, 42, 24, 33, 46, 3, 20, 0, 18, 10, 12, 44, 56, 0, 29, 8, 0, 31, 14, 38, 44, 0, 30, 28, 9, 24, 18, 30, 34, 29, 8, 0, 50, 6
Offset: 1

Views

Author

Labos Elemer, May 30 2002

Keywords

Examples

			invphi(65536*103) = {6750209,13500418}, so a(27) = 2.
Observe that a(15) = 0 because 47 needs very large 2^i multiplier (instead of 65536) to give nonempty InvPhi set.
		

Crossrefs

Programs

  • Maple
    [seq(nops(invphi(65536*ithprime(i))),i=1..128)];
  • PARI
    a(n) = invphiNum(65536 * prime(n)); \\ Amiram Eldar, Nov 11 2024, using Max Alekseyev's invphi.gp