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.

A336385 Number of k = x*y such that phi(k) = n*(phi(x) + phi(y)).

Original entry on oeis.org

2, 5, 15, 14, 7, 25, 7, 36, 30, 26, 15, 68, 2, 21, 125, 78, 9, 94, 7, 90, 52, 33, 38, 208, 15, 11, 74, 69, 3, 227, 2, 166, 66, 33, 129, 276, 2, 25, 101, 228, 7, 115, 8, 76, 329, 47, 28, 482, 19, 65, 40, 50, 7, 248, 99, 234, 46, 34, 20, 572, 2, 5, 426, 356, 16
Offset: 1

Views

Author

Jinyuan Wang, Aug 01 2020

Keywords

Comments

If phi(x*y) = n*(phi(x) + phi(y)) and phi(x) <= phi(y), then phi(x) <= 2*n and phi(y) <= n*phi(x).
a(n) >= 1 because (k, x, y) = (4*n^2, 2*n, 2*n) is a solution.
If gcd(n, 6) = 1, then a(n) >= 2 because (k, x, y) = (12*n^2, 3*n, 4*n) is also a solution. Note that a(n) = 2 when n = 1, 13, 31, 37, 61, 73, 97, 103, 149, 151, 157, 181, ...
Conjecture: a(n) > 2 if n is composite.

Examples

			a(2) = 5 because k = 16, 24, 36, 40 and 60 satisfy the equation.
		

Crossrefs

Programs

  • PARI
    f(n) = floor(n*exp(Euler)*log(log(n^2))+2.5*n/log(log(n^2)));
    a(n) = {if(n==1, return(2)); my(t, v=List([])); for(x=1, f(2*n), if((t=eulerphi(x)) <= 2*n, for(y=1, f(t=n*t), if(eulerphi(x*y) == t+n*eulerphi(y), listput(v, x*y))))); #Set(v); }
Showing 1-1 of 1 results.