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.

A073456 Numbers n such that phi(n) = pi(n)+1.

Original entry on oeis.org

1, 5, 36, 48, 84
Offset: 1

Views

Author

Labos Elemer, Aug 02 2002

Keywords

Examples

			15 primes below 48 = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47}; 16 terms in RRS[48]={1,5,7,11,13,17,19,23,25,29,31,35,37,41,43,47}, so 48 is here.
		

Crossrefs

Programs

  • Mathematica
    Do[s=EulerPhi[n]-PrimePi[n]; If[Equal[s, 1], Print[n]], {n, 1, 10000}]
    Select[Range[100],EulerPhi[#]==PrimePi[#]+1&] (* Harvey P. Dale, Oct 23 2024 *)

Formula

Solutions to A000010(x)=A000720(x)+k, where k=+1; finite for any fixed value of k.

Extensions

Definition modified by Harvey P. Dale, Oct 23 2024