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-3 of 3 results.

A104905 Numbers m such that d(m)*phi(m) = sigma(m), where d(m) is number of positive divisors of m.

Original entry on oeis.org

1, 3, 14, 42
Offset: 1

Views

Author

Farideh Firoozbakht, Apr 13 2005

Keywords

Comments

d(m)*phi(m) is the product of f(p^k) = (p^k - p^(k-1))*(1+k), while sigma(m) is the product of g(p^k) = (p^(k+1)-1)/(p-1) taken over all prime powers p^k in the factorization of m. We have f(p^k) < g(p^k) for p=2 and k=1 or 2; f(p^k) = g(p^k) for p=3, k=1; and f(p^k) > g(p^k) in all other cases. Furthermore, f(2)/g(2) = 2/3 and f(2^2)/g(2^2) = 6/7, while f(p^k)/g(p^k) > f(p)/g(p) and for p > 7, f(p)/g(p) > 3/2. It easily follows that 1,3,14,42 are the only terms of this sequence. - Max Alekseyev, Feb 08 2010

Examples

			42 is in the sequence because d(42)=8; phi(42)=12; sigma(42)=96 & 8*12=96.
		

Crossrefs

Programs

  • Mathematica
    Do[If[DivisorSigma[0, n]*EulerPhi[n] == DivisorSigma[1, n], Print[n]], {n, 530000000}]

Extensions

Keywords full, fini from Max Alekseyev, Feb 08 2010

A104904 Numbers n such that d(n)*pi(n)=n, where d(n) is the number of positive divisors of n.

Original entry on oeis.org

2, 8408, 481044, 189961452, 75370122528, 75370124832, 4086199302976, 221945984411264
Offset: 1

Views

Author

Farideh Firoozbakht, Apr 12 2005

Keywords

Comments

Next term is greater than 3*10^9.

Examples

			189961452 is in the sequence because d(189961452)=18; pi(189961452)=10553414 & 18*10553414=189961452.
		

Crossrefs

Programs

  • Mathematica
    Do[If[DivisorSigma[0, n]*PrimePi[n] == n, Print[n]], {n, 2000000000}]

Extensions

a(5)-a(8) from Donovan Johnson, Dec 08 2009

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

Original entry on oeis.org

1, 10, 831, 8310
Offset: 1

Views

Author

Farideh Firoozbakht, Apr 14 2005

Keywords

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

Examples

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

Crossrefs

Programs

  • Mathematica
    reversal[n_]:= FromDigits[Reverse[IntegerDigits[n]]]; Do[If[DivisorSigma[0, n]*reversal[n] == EulerPhi[n], Print[n]], {n, 350000000}]
Showing 1-3 of 3 results.