A291565 -id:A291565 - cp's OEIS frontend

A020492 Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203).

1, 2, 3, 6, 12, 14, 15, 30, 35, 42, 56, 70, 78, 105, 140, 168, 190, 210, 248, 264, 270, 357, 418, 420, 570, 594, 616, 630, 714, 744, 812, 840, 910, 1045, 1240, 1254, 1485, 1672, 1848, 2090, 2214, 2376, 2436, 2580, 2730, 2970, 3080, 3135, 3339, 3596, 3720, 3828

Offset: 1

David W. Wilson

nonn

The quotient A020492(n)/A002088(n) = SummatorySigma/SummatoryTotient as n increases seems to approach Pi^4/36 or zeta(2)^2 [~2.705808084277845]. - Labos Elemer, Sep 20 2004, corrected by Charles R Greathouse IV, Jun 20 2012
If 2^p-1 is prime (a Mersenne prime) then m = 2^(p-2)*(2^p-1) is in the sequence because when p = 2 we get m = 3 and phi(3) divides sigma(3) and for p > 2, phi(m) = 2^(p-2)*(2^(p-1)-1); sigma(m) = (2^(p-1)-1)*2^p hence sigma(m)/phi(m) = 4 is an integer. So for each n, A133028(n) = 2^(A000043(n)-2)*(2^A000043(n)-1) is in the sequence. - Farideh Firoozbakht, Nov 28 2005
Phi and sigma are both multiplicative functions and for this reason if m and n are coprime and included in this sequence then m*n is also in this sequence. - Enrique Pérez Herrero, Sep 05 2010
The quotients sigma(n)/phi(n) are in A023897. - Bernard Schott, Jun 06 2017
There are 544768 balanced numbers < 10^14. - Jud McCranie, Sep 10 2017
a(975807) = 419998185095132. - Jud McCranie, Nov 28 2017

			sigma(35) = 1+5+7+35 = 48, phi(35) = 24, hence 35 is a term.

D. Chiang, "N's for which phi(N) divides sigma(N)", Mathematical Buds, Chap. VI pp. 53-70 Vol. 3 Ed. H. D. Ruderman, Mu Alpha Theta 1984.

Donovan Johnson, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Jud McCranie, 670314 balanced numbers (first 1000 from T. D. Noe, first 10000 from Donovan Johnson)

Cf. A000010, A000043, A000203, A000668, A011257, A023897, A133028, A291565, A291566, A292422, A351114 (characteristic function).

Positions of 0's in A063514.

[ n: n in [1..3900] | SumOfDivisors(n) mod EulerPhi(n) eq 0 ]; // Klaus Brockhaus, Nov 09 2008

Select[ Range[ 4000 ], IntegerQ[ DivisorSigma[ 1, # ]/EulerPhi[ # ] ]& ]
(* Second program: *)
Select[Range@ 4000, Divisible[DivisorSigma[1, #], EulerPhi@ #] &] (* Michael De Vlieger, Nov 28 2017 *)

select(n->sigma(n)%eulerphi(n)==0,vector(10^4,i,i)) \\ Charles R Greathouse IV, Jun 20 2012

from sympy import totient, divisor_sigma
print([n for n in range(1, 4001) if divisor_sigma(n)%totient(n)==0]) # Indranil Ghosh, Jul 06 2017

from math import prod
from itertools import count, islice
from sympy import factorint
def A020492_gen(startvalue=1): # generator of terms >= startvalue
    for m in count(max(startvalue,1)):
        f = factorint(m)
        if not prod(p**(e+2)-p for p,e in f.items())%(m*prod((p-1)**2 for p in f)):
            yield m
A020492_list = list(islice(A020492_gen(),20)) # Chai Wah Wu, Aug 12 2024

More terms from Farideh Firoozbakht, Nov 28 2005

A291566 Non-primitive balanced numbers: balanced numbers of the form m*n where m, n > 1 are both balanced.

Original entry on oeis.org

6, 30, 42, 70, 105, 168, 210, 420, 570, 714, 744, 840, 1254, 1848, 2090, 2436, 2730, 2970, 3135, 3720, 5016, 6270, 6678, 8680, 9240, 10098, 10788, 11868, 12180, 12192, 12540, 13566, 14630, 15834, 16188, 20790, 21318, 24024, 24882, 25080, 25908, 26040, 26796, 32130, 43890, 48360

Offset: 1

Jud McCranie, Aug 26 2017

nonn

A positive integer, n, is a balanced number (A020492) if sigma(n) is a multiple of phi(n). Since phi and sigma are multiplicative functions, if m and n are balanced numbers and gcd(m,n)=1, mn is also a balanced number. This sequence consists of only these imprimitive terms.

			2 and 3 are balanced numbers, gcd(2,3)=1, so 6 is a non-primitive balanced number.

Amiram Eldar, Table of n, a(n) for n = 1..5000

Cf. A020492, A291565.

balQ[n_] := Divisible[DivisorSigma[1,n], EulerPhi[n]]; nonprimQ[n_] := balQ[n] && Module[{d = Divisors[n], ans = False}, Do[If[GCD[d[[k]], n/d[[k]]]==1 && balQ[ d[[k]]] && balQ[n/d[[k]]], ans=True; Break[]], {k, 2, Floor[Length[d]/2]}]; ans]; Select[Range[50000], nonprimQ] (* Amiram Eldar, Jun 26 2019 *)

A342438 Primitive arithmetic numbers: terms of A003601 not of the form m*q where m, q > 1 are both terms of A003601 with gcd(m,q) = 1.

Original entry on oeis.org

1, 3, 5, 6, 7, 11, 13, 14, 17, 19, 20, 22, 23, 27, 29, 31, 37, 38, 41, 43, 44, 45, 46, 47, 49, 53, 54, 56, 59, 61, 62, 67, 68, 71, 73, 79, 83, 86, 89, 92, 94, 96, 97, 99, 101, 103, 107, 109, 113, 116, 118, 125, 126, 127, 131, 134, 137, 139, 142, 149, 150, 151

Offset: 1

Bernard Schott, Mar 12 2021

nonn

A positive integer m is an arithmetic number (A003601) if sigma(m) (A000203) is a multiple of tau(m) (A000005). Since sigma and tau are multiplicative, if m and q are arithmetic numbers and gcd(m,q)=1, m*q is also an arithmetic number. This sequence eliminates these non-primitive terms.
Some subsequences:
  - odd primes (A065091),
  - squares of primes of the form 6m+1 (A002476),
  - cubes of odd primes (A030078 \ {8}),
  - semiprimes 2*p where prime p is of the form 4k+3 (A002145),
  - Integers equal to 4*p where p is a prime of the form 6k-1 (A007528).

			6 and 17 are arithmetic numbers, gcd(6,17)=1, so 102 is a non-primitive arithmetic number while 6 and 17 are primitive arithmetic numbers.
7 is an arithmetic number; gcd(7,7) = 7; as sigma(49) = 57 and tau(49) = 3, sigma(49)/tau(49) = 19, so 7*7 = 49 is a primitive term because gcd(7,7) <> 1.

Cf. A000005 (tau), A000203 (sigma).
Cf. A002145 (4k+3 primes), A002476 (6k+1 primes).
Subsequence of A003601.
Subsequences: A065091 (odd primes), A030078 \ {8} (cubes of odd primes).
Cf. A291565 (similar for primitive balanced numbers).

arithQ[n_] := arithQ[n] = Divisible[DivisorSigma[1, n], DivisorSigma[0, n]]; primArithQ[n_] := primArithQ[n] = (n == 1) || (arithQ[n] && !AnyTrue[Most @ Rest @ Divisors[n], CoprimeQ[#, n/#] && arithQ[#] && arithQ[n/#] &]); Select[Range[150], primArithQ] (* Amiram Eldar, Mar 12 2021 *)

isar(n) = !(sigma(n)%numdiv(n)); \\ A003601
isok(n) = {if (isar(n), fordiv(n, d, if ((d>1) && (dMichel Marcus, Mar 12 2021

Name clarified by N. J. A. Sloane, Mar 13 2021

cp's OEIS Frontend

A020492 Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Python

Extensions

A291566 Non-primitive balanced numbers: balanced numbers of the form m*n where m, n > 1 are both balanced.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A342438 Primitive arithmetic numbers: terms of A003601 not of the form m*q where m, q > 1 are both terms of A003601 with gcd(m,q) = 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions