A065818 -id:A065818 - cp's OEIS frontend

A065822 Numbers k such that 5phi(k) = 4sigma(k).

323, 377, 22591, 42619, 49751, 106711, 119647, 180947, 2782057, 2980823, 2981233, 3794737, 5112427, 5285743, 5732179, 5964229, 6073267, 6669797, 6769927, 7049407, 8025547, 8350633, 8954023, 9373213, 10039471, 10140517, 10842901

Offset: 1

Labos Elemer, Nov 23 2001

nonn

Amiram Eldar, Table of n, a(n) for n = 1..335 (terms 1..60 from Harry J. Smith)

Cf. A000010, A000203, A065818, A065819, A062699.

Select[Range[1085*10^4],5EulerPhi[#]==4DivisorSigma[1,#]&] (* Harvey P. Dale, Aug 11 2019 *)

{ n=0; for (m=1, 10^9, if (5*eulerphi(m) == 4*sigma(m), write("b065822.txt", n++, " ", m); if (n==60, return)) ) } \\ Harry J. Smith, Nov 01 2009

is(n) = {my(f=factor(n)); 5*eulerphi(f) == 4*sigma(f);} \\ Amiram Eldar, Jun 26 2024

a(9)-a(27) from Harry J. Smith, Nov 01 2009

A065824 Smallest solution m to (n+1)phi(m) = nsigma(m), or -1 if no solution exists.

Original entry on oeis.org

3, 5, 7, 323, 11, 13, 899, 17, 19, 1763, 23, 5249, 3239, 29, 31, 979801, 5459, 37, 10763, 41, 43, 9179, 47, 9701, 10403, 53, 12319, 5646547, 59, 61, 24569, 19109, 67, 19043, 71, 73, 22499, 50819, 79, 41309, 83, 32639, 46979, 89, 34579, 39059, 125969

Offset: 1

Labos Elemer, Nov 23 2001

If p = a(n) is a prime solution, then (n+1)*(p-1) = n*(p+1) and p = 2n+1, so position for p if it is in fact a minimal solution is at n = (p-1)/2. E.g. 29 appears at 14th position shown by A005097. On the other hand large and (seemingly always composite) solutions arise at indices shown essentially by A047845. Also, differences between the sites of two consecutive small prime solutions appears to be d/2, half the difference between consecutive primes (A001223).

Donovan Johnson, Table of n, a(n) for n = 1..456

Cf. A000010, A000203, A062699, A065818, A065819, A065822, A065823.

See also A005097, A047845, A014076, A001223.

max = 10^7; a[n_] := For[m = 3, m <= max, m++, If[(n+1)*EulerPhi[m] == n*DivisorSigma[1, m], Print[m]; Return[m]]] /. Null -> -1; Array[a, 50] (* Jean-François Alcover, Oct 08 2016 *)

from itertools import count
from math import prod
from sympy import factorint
def A065824(n):
    for m in count(1):
        f = factorint(m)
        if (n+1)*m*prod((p-1)**2 for p in f)==n*prod(p**(e+2)-p for p,e in f.items()):
            return m # Chai Wah Wu, Aug 12 2024

(n+1)*A000010(a(n)) = n*A000203(a(n)), smallest x=a(n) solutions.

A065823 Numbers k such that 6phi(k) = 5sigma(k).

Original entry on oeis.org

11, 527, 923, 36859, 40549, 55309, 88519, 120139, 138301, 280579, 293501, 313807, 529789, 719927, 2458859, 4864117, 6191413, 6811243, 7297877, 8402663, 8624107, 9487477, 10475821, 12356441, 12940957, 13624717, 13971229, 14869033, 15293137

Offset: 1

Labos Elemer, Nov 23 2001

nonn

Not all terms are squarefree: a(74) = 137640191 = 13^2 * 89 * 9151. - Charles R Greathouse IV, Nov 13 2015

Apart from the first term, no terms are divisible by 2, 3, 5, 7, or 11. - Charles R Greathouse IV, Nov 13 2015

Harry J. Smith and Charles R Greathouse IV, Table of n, a(n) for n = 1..651 (first 70 terms from Smith)

Subsequence of A008364.

Cf. A000010, A000203, A065818, A065819, A062699, A065822, A274535(5*sigma(n)).

n=0; for (m=1, 10^9, if (6*eulerphi(m) == 5*sigma(m), write("b065823.txt", n++, " ", m); if (n==70, return))) \\ Harry J. Smith, Nov 01 2009

is(n)=my(f=factor(n)); 6*eulerphi(f)==5*sigma(f) \\ Charles R Greathouse IV, Nov 13 2015

Terms a(16)-a(29) from Harry J. Smith, Nov 01 2009

cp's OEIS Frontend

A065822 Numbers k such that 5phi(k) = 4sigma(k).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Extensions

A065824 Smallest solution m to (n+1)phi(m) = nsigma(m), or -1 if no solution exists.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

Formula

A065823 Numbers k such that 6phi(k) = 5sigma(k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Extensions

cp's OEIS Frontend

A065822 Numbers k such that 5*phi(k) = 4*sigma(k).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Extensions

A065824 Smallest solution m to (n+1)*phi(m) = n*sigma(m), or -1 if no solution exists.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

Formula

A065823 Numbers k such that 6*phi(k) = 5*sigma(k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Extensions

A065822 Numbers k such that 5phi(k) = 4sigma(k).

A065824 Smallest solution m to (n+1)phi(m) = nsigma(m), or -1 if no solution exists.

A065823 Numbers k such that 6phi(k) = 5sigma(k).