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.

Showing 1-1 of 1 results.

A330702 Numbers k such that psi(k) = psi(k + 2) and phi(k) = phi(k + 2), where psi(k) is the Dedekind psi function (A001615) and phi(k) is the Euler totient function (A000010).

Original entry on oeis.org

70, 308, 572, 2132, 4292, 6764, 12212, 32804, 72836, 79292, 169724, 198596, 207692, 289052, 362972, 392426, 545876, 547724, 611612, 651932, 678812, 687812, 809252, 842012, 868436, 930932, 1030772, 1032956, 1122932, 1336052, 1627772, 1705892, 1722932, 2173772
Offset: 1

Views

Author

Amiram Eldar, Dec 26 2019

Keywords

Comments

Sandor asked whether this sequence is infinite.
Apparently the only common solution to psi(n) = psi(n+1) and phi(n) = phi(n+1) is 15.

Examples

			70 is a term since psi(70) = psi (72) = 144 and phi(70) = phi(72) = 24.
		

Crossrefs

Intersection of A001494 and A330703.

Programs

  • Mathematica
    psi[1] = 1; psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); Select[Range[10^5], psi[#] == psi[# + 2] && EulerPhi[#] == EulerPhi[#+2] &]
Showing 1-1 of 1 results.