A083246 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A083246

Numbers n such that at least one of the following four conditions is satisfied: 1# d(n)=phi(n); 2# d(n)=u(n); 3# phi(n)=u(n), or 4# n=2u(n). Here d(n)=A000005(n) is the number of divisors of n, phi(n)=A000010(n) is Euler's totient and u(n)=A045763(n) is the size of the 'unrelated set'.

1, 3, 8, 10, 15, 18, 24, 25, 30, 50, 61455

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Is this sequence complete?

LINKS

Table of n, a(n) for n=1..11.

EXAMPLE

1# d(n)=phi(n) holds for {1,3,8,10,18,24,30}, see A020488;

2# d(n)=u(n) holds for {15,25};

3# phi(n)=u(n) holds for {61455};

4# n=2u(n) holds for {30,50}. No more cases below 10^7.

{n,d,r,u} values for 11 initial terms are as follows:

{1, 1, 1, 0}, {3, 2, 2, 0}, {8, 4, 4, 1}, {10, 4, 4, 3}, {15, 4, 8, 4}, {18, 6, 6, 7}{24, 8, 8, 9}, {25, 3, 20, 3}, {30, 8, 8, 15}, {50, 6, 20, 25}, {61455, 16, 30720, 30720}.

MATHEMATICA

Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; If[Equal[d, r]||Equal[d, u]||Equal[r, u]||Equal[u, n-u], Print[n(*, {d, r, u}*)]], {n, 1, 10000000}]

PROG

(PARI) is(n)=my(r=eulerphi(n), d=numdiv(n), u=n-r-d+1); d==r||d==u||r==u||2*u==n \\ Charles R Greathouse IV, Feb 21 2013

CROSSREFS

Cf. A000005, A000010, A045763, A073757, A083243, A083244, A083246, A020488.

Sequence in context: A184870 A073547 A047356 * A023492 A022801 A128699

Adjacent sequences: A083243 A083244 A083245 * A083247 A083248 A083249

KEYWORD

nonn,less

AUTHOR

Labos Elemer, May 07 2003

STATUS

approved