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.

A225983 Numbers k such that gcd(phi(k), tau(k)) = 1.

Original entry on oeis.org

1, 2, 4, 16, 25, 64, 81, 100, 121, 256, 289, 484, 529, 729, 841, 1024, 1156, 1296, 1600, 1681, 2116, 2209, 2401, 2809, 3025, 3364, 3481, 4096, 4624, 5041, 5184, 6400, 6724, 6889, 7225, 7744, 7921, 8464, 8836, 10201, 11236, 11449, 11664, 12100, 12769, 13225
Offset: 1

Views

Author

Paolo P. Lava, May 22 2013

Keywords

Examples

			If n = 13924 then phi(n) = 6844 = 2^2*29*59 and tau(n) = 9 = 3^2. There is no common prime factor.
		

Crossrefs

Programs

  • Maple
    with(numtheory); A225983:=proc(q) local n;
    for n from 1 to q do if gcd(tau(n),phi(n))=1 then print(n);
    fi; od; end: A225983(10^6);
  • Mathematica
    t = {}; n = 0; While[Length[t] < 100, n++; If[GCD[EulerPhi[n], DivisorSigma[0, n]] == 1, AppendTo[t, n]]]; t (* T. D. Noe, May 22 2013 *)