A104906 Numbers n such that d(n)*reversal(n)=phi(n), where d(n) is number of positive divisors of n.

1, 10, 831, 8310

Offset

1,2

Comments

If n is a term of this sequence and gcd(10,n)=1 then 10*n is also in the sequence because reversal(10*n)=reversal(n); d(10)=phi(10) and both functions d & phi are multiplicative. No further terms up to 350000000.

a(5) > 10^12. - Giovanni Resta, Apr 25 2017

Links

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

Example

8310 is in the sequence because d(8310)=16; reversal(8310)=138;
phi(8310)=2208 & 16*138=2108.

Mathematica

reversal[n_]:= FromDigits[Reverse[IntegerDigits[n]]]; Do[If[DivisorSigma[0, n]*reversal[n] == EulerPhi[n], Print[n]], {n, 350000000}]

Crossrefs

Cf. A063903, A104904, A104905, A104907.

Sequence in context: A054944 A272854 A015093 * A013386 A013385 A013383

Adjacent sequences: A104903 A104904 A104905 * A104907 A104908 A104909

Keyword

more,nonn

Author

Farideh Firoozbakht, Apr 14 2005

Status

approved