A102187 -id:A102187 - cp's OEIS frontend

A003601 Numbers j such that the average of the divisors of j is an integer: sigma_0(j) divides sigma_1(j). Alternatively, numbers j such that tau(j) (A000005(j)) divides sigma(j) (A000203(j)).

1, 3, 5, 6, 7, 11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 27, 29, 30, 31, 33, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 51, 53, 54, 55, 56, 57, 59, 60, 61, 62, 65, 66, 67, 68, 69, 70, 71, 73, 77, 78, 79, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 96, 97, 99, 101, 102, 103, 105

Offset: 1

N. J. A. Sloane, Mira Bernstein

Sometimes called arithmetic numbers.
Generalized (sigma_r)-numbers are numbers j for which sigma_r(j)/sigma_0(j) = c^r. Sigma_r(j) denotes the sum of the r-th powers of the divisors of j; c,r are positive integers. The numbers in this sequence are sigma_1-numbers; those in A140480 are sigma_2-numbers. - Ctibor O. Zizka, Jul 14 2008
{a(n)} = union A175678 and A175679 where A175678 = numbers m such that the arithmetic mean Ad(m) of divisors of m and the arithmetic mean Ah(m) of numbers h < m such that gcd(h,m) = 1 are both integers and A175679 = numbers m such that the arithmetic mean Ad(m) of the divisors of m and the arithmetic mean Ak(m) of the numbers k <= m are both integers. - Jaroslav Krizek, Aug 07 2010
All odd primes (A065091) are arithmetic numbers. - Wesley Ivan Hurt, Oct 04 2013
A069928(n) = number of arithmetic numbers not greater than n. - Reinhard Zumkeller, Jul 28 2014
A102187(n) divides a(n) for a(n) = 1, 6, 140, 270, 672, ... A007340. - Thomas Ordowski, Oct 24 2014
The quotients sigma(j)/tau(j) are in A102187. - Bernard Schott, Jun 07 2017

			Sigma(6) = 12, tau(6) = 4, sigma(6)/tau(6) = 3 so 6 belongs to this sequence. - _Bernard Schott_, Jun 07 2017

R. K. Guy, Unsolved Problems in Number Theory, B2.
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section III.51.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..10000
Marco Abrate, Stefano Barbero, Umberto Cerruti, and Nadir Murru, The Biharmonic mean, arXiv:1601.03081 [math.NT], 2016.
Paul T. Bateman, Paul Erdős, Carl Pomerance, and E. G. Straus, The arithmetic mean of the divisors of an integer (1981). In Knopp, M.I. ed., Analytic number theory, Proc. Conf., Temple Univ., 1980. Lecture Notes in Mathematics. 899. Springer-Verlag., pp. 197-220.
Antonio M. Oller-Marcén, On arithmetic numbers, arXiv:1206.1823 [math.NT], 2012.
O. Ore, On the averages of the divisors of a number, Amer. Math. Monthly, 55 (1948), 615-619.
Wikipedia, Arithmetic number.

Complement is A049642.
Cf. A000005, A000203, A054025, A001599, A007340, A140480, A102187.
Cf. A245644, A245656, A069928. Nonprimes are in A023883.

a:=Filtered([1..110],n->Sigma(n) mod Tau(n)=0);; Print(a); # Muniru A Asiru, Jan 25 2019

a003601 n = a003601_list !! (n-1)
a003601_list = filter ((== 1) . a245656) [1..]
-- Reinhard Zumkeller, Jul 28 2014, Dec 31 2013, Jan 06 2012

with(numtheory); t := [ ]: f := [ ]: for n from 1 to 500 do if sigma(n) mod tau(n) = 0 then t := [ op(t), n ] else f := [ op(f), n ]; fi; od: t; # corrected by Wesley Ivan Hurt, Oct 03 2013

Select[Range[120], IntegerQ[DivisorSigma[1, # ]/DivisorSigma[0, # ]] &] (* Stefan Steinerberger, Apr 03 2006 *)

is(n)=sigma(n)%numdiv(n)==0 \\ Charles R Greathouse IV, Jul 10 2012

from sympy import divisors, divisor_count
[n for n in range(1,10**5) if not sum(divisors(n)) % divisor_count(n)] # Chai Wah Wu, Aug 05 2014

a(n) ~ n. - Charles R Greathouse IV, Jul 10 2012

A245656(a(n)) = 1. - Reinhard Zumkeller, Jul 28 2014

David W. Wilson, Oct 15 1996, points out that 30 was missing.

More terms from Stefan Steinerberger, Apr 03 2006

A057660 a(n) = Sum_{k=1..n} n/gcd(n,k).

Original entry on oeis.org

1, 3, 7, 11, 21, 21, 43, 43, 61, 63, 111, 77, 157, 129, 147, 171, 273, 183, 343, 231, 301, 333, 507, 301, 521, 471, 547, 473, 813, 441, 931, 683, 777, 819, 903, 671, 1333, 1029, 1099, 903, 1641, 903, 1807, 1221, 1281, 1521, 2163, 1197, 2101, 1563, 1911, 1727

Offset: 1

Henry Gould, Oct 15 2000

Also sum of the orders of the elements in a cyclic group with n elements, i.e., row sums of A054531. - Avi Peretz (njk(AT)netvision.net.il), Mar 31 2001
Also inverse Moebius transform of EulerPhi(n^2), A002618.
Sequence is multiplicative with a(p^e) = (p^(2*e+1)+1)/(p+1). Example: a(10) = a(2)*a(5) = 3*21 = 63.
a(n) is the number of pairs (a, b) such that the equation ax = b is solvable in the ring (Zn, +, x). See the Mathematical Reflections link. - Michel Marcus, Jan 07 2017
From Jake Duzyk, Jun 06 2023: (Start)
These are the "contraharmonic means" of the improper divisors of square integers (inclusive of 1 and the square integer itself).
Permitting "Contraharmonic Divisor Numbers" to be defined analogously to Øystein Ore's Harmonic Divisor Numbers, the only numbers for which there exists an integer contraharmonic mean of the divisors are the square numbers, and a(n) is the n-th integer contraharmonic mean, expressible also as the sum of squares of divisors of n^2 divided by the sum of divisors of n^2. That is, a(n) = sigma_2(n^2)/sigma(n^2).
(a(n) = A001157(k)/A000203(k) where k is the n-th number such that A001157(k)/A000203(k) is an integer, i.e., k = n^2.)
This sequence is an analog of A001600 (Harmonic means of divisors of harmonic numbers) and A102187 (Arithmetic means of divisors of arithmetic numbers). (End)

David M. Burton, Elementary Number Theory, Allyn and Bacon Inc., Boston MA, 1976, p. 152.
H. W. Gould and Temba Shonhiwa, Functions of GCD's and LCM's, Indian J. Math. (Allahabad), Vol. 39, No. 1 (1997), pp. 11-35.
H. W. Gould and Temba Shonhiwa, A generalization of Cesaro's function and other results, Indian J. Math. (Allahabad), Vol. 39, No. 2 (1997), pp. 183-194.

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)
Habib Amiri and S. M. Jafarian Amiri, Sum of element orders on finite groups of the same order, J. Algebra Appl. 10 (2011), no. 2, 187--190. MR2795731 (2012d:20050)
Habib Amiri, S. M. Jafarian Amiri, and I. M. Isaacs, Sums of element orders in finite groups Comm. Algebra 37 (2009), no. 9, 2978--2980. MR2554185 (2010i:20022)
Miriam Mahannah El-Farrah, Expectation Numbers of Cyclic Groups, MS Thesis, Western Kentucky University, August 2015.
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 154-5.
Walther Janous, Problem 10829, Amer. Math. Monthly, 107 (2000), p. 753.
Yadollah Marefat, Ali Iranmanesh, and Abolfazl Tehranian, On the sum of element orders of finite simple groups, J. Algebra Applications, 12 (2013), #1350026.
Mathematical Reflections, Solution to Problem U338, Issue 4, 2015, p 17.
Joachim von zur Gathen, Arnold Knopfmacher, Florian Luca, Lutz G. Lucht, and Igor E. Shparlinski, Average order of cyclic groups, J. Théorie Nombres Bordeaux 16 (1) (2004) 107-123.

Cf. A000010, A000203, A000290, A001157, A018804, A050873, A051193, A054522, A057661, A061255, A065764, A078747, A174405 (partial sums), A176797, A226512.

Cf. A308471.

a057660 n = sum $ map (div n) $ a050873_row n
-- Reinhard Zumkeller, Nov 25 2013

Table[ DivisorSigma[ 2, n^2 ] / DivisorSigma[ 1, n^2 ], {n, 1, 128} ]
Table[Total[Denominator[Range[n]/n]], {n, 55}] (* Alonso del Arte, Oct 07 2011 *)
f[p_, e_] := (p^(2*e + 1) + 1)/(p + 1); a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Nov 21 2020 *)

a(n)=if(n<1,0,sumdiv(n,d,d*eulerphi(d)))

a(n)=sumdivmult(n,d, eulerphi(d)*d) \\ Charles R Greathouse IV, Sep 09 2014

from math import gcd
def A057660(n): return sum(n//gcd(n,k) for k in range(1,n+1)) # Chai Wah Wu, Aug 24 2023

from math import prod
from sympy import factorint
def A057660(n): return prod((p**((e<<1)+1)+1)//(p+1) for p,e in factorint(n).items()) # Chai Wah Wu, Aug 05 2024

a(n) = Sum_{d|n} d*A000010(d) = Sum_{d|n} d*A054522(n,d), sum of d times phi(d) for all divisors d of n, where phi is Euler's phi function.
a(n) = sigma_2(n^2)/sigma_1(n^2) = A001157(A000290(n))/A000203(A000290(n)) = A001157(A000290(n))/A065764(n). - Labos Elemer, Nov 21 2001
a(n) = Sum_{d|n} A000010(d^2). - Enrique Pérez Herrero, Jul 12 2010
a(n) <= (n-1)*n + 1, with equality if and only if n is noncomposite. - Daniel Forgues, Apr 30 2013
G.f.: Sum_{n >= 1} n*phi(n)*x^n/(1 - x^n) = x + 3*x^2 + 7*x^3 + 11*x^4 + .... Dirichlet g.f.: sum {n >= 1} a(n)/n^s = zeta(s)*zeta(s-2)/zeta(s-1) for Re s > 3.  Cf. A078747 and A176797. - Peter Bala, Dec 30 2013
a(n) = Sum_{i=1..n} numerator(n/i). - Wesley Ivan Hurt, Feb 26 2017
L.g.f.: -log(Product_{k>=1} (1 - x^k)^phi(k)) = Sum_{n>=1} a(n)*x^n/n. - Ilya Gutkovskiy, May 21 2018
From Richard L. Ollerton, May 10 2021: (Start)
a(n) = Sum_{k=1..n} lcm(n,k)/k.
a(n) = Sum_{k=1..n} gcd(n,k)*phi(gcd(n,k))/phi(n/gcd(n,k)). (End)
From Vaclav Kotesovec, Jun 13 2021: (Start)
Sum_{k=1..n} a(k)/k ~ 3*zeta(3)*n^2/Pi^2.
Sum_{k=1..n} k^2/a(k) ~ A345294 * n.
Sum_{k=1..n} k*A000010(k)/a(k) ~ A345295 * n. (End)
Sum_{k=1..n} a(k) ~ 2*zeta(3)*n^3/Pi^2. - Vaclav Kotesovec, Jun 10 2023

More terms from James Sellers, Oct 16 2000

A342103 Balanced numbers (A020492) that are also arithmetic numbers (A003601).

Original entry on oeis.org

1, 3, 6, 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, 3956, 4064, 4180

Offset: 1

Bernard Schott, Feb 28 2021

nonn

Equivalently, numbers m such that phi(m) (A000010) and tau(m) (A000005) both divide sigma(m) (A000203). In this case, the quotients sigma(m)/phi(m) = A023897(m) and sigma(m)/tau(m) = A102187(m).
Phi, tau and sigma are multiplicative functions and for this reason if k and q are coprime and included in this sequence then k*q is another term.
The only prime in the sequence is 3, because sigma(2)/tau(2) = 3/2 and when p is an odd prime, sigma(p)/phi(p) = (p+1)/(p-1) is an integer iff p=3 with sigma(3)/phi(3) = 4/2 = 2, and also sigma(3)/tau(3) = 4/2 = 2.

			phi(30) = tau(30) = 8, sigma(30) = 72 and 72/8 = 9, hence 30 is a term.
phi(12) = 4, tau(12) = 6, sigma(12) = 28, phi(12) divides sigma(12), but tau(12) does not divide sigma(12), hence 12 is a balanced number but is not an arithmetic number, and 12 is not a term.
phi(20) = 8, tau(20) = 6, sigma(20) = 42, tau(20) divides sigma(20), but phi(20) does not divide sigma(20), hence 20 is an arithmetic number but is not a balanced number, and 20 is not a term.

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

Intersection of A003601 and A020492.
Cf. A000005 (tau), A000010 (phi), A000203 (sigma), A023897 (sigma/phi), A102187 (sigma/tau).
Cf. A342104, A342105, A342106.

with(numtheory): filter:= q -> (sigma(q) mod phi(q) = 0) and (sigma(q) mod tau(q) = 0) : select(filter, [$1..5000]);

Select[Range[5000], And @@ Divisible[DivisorSigma[1, #], {DivisorSigma[0, #], EulerPhi[#]}] &] (* Amiram Eldar, Feb 28 2021 *)

isok(m) = my(s=sigma(m)); !(s % eulerphi(m)) && !(s % numdiv(m)); \\ Michel Marcus, Mar 01 2021

A157847 Numbers which are not a mean of divisors of some arithmetic number A003601(k).

Original entry on oeis.org

5, 11, 17, 23, 25, 29, 41, 43, 46, 47, 50, 53, 58, 59, 67, 71, 73, 77, 83, 85, 86, 89, 92, 94, 95, 101, 103, 107, 109, 113, 116, 118, 125, 131, 134, 137, 145, 146, 149, 151, 163, 167, 170, 172, 173, 178, 179, 181, 185, 188, 191, 193, 197, 202, 206, 209, 214, 215, 218, 219

Offset: 1

Jaroslav Krizek, Mar 07 2009

nonn

Numbers not occurring in A102187. The complement to A157846.

Zak Seidov, Table of n, a(n) for n = 1..1000

Cf. A102187, A003601, A000203, A000005.

Edited and extended by R. J. Mathar, Mar 15 2009

A342105 Arithmetic numbers (A003601) that are not balanced numbers (A020492).

Original entry on oeis.org

5, 7, 11, 13, 17, 19, 20, 21, 22, 23, 27, 29, 31, 33, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 51, 53, 54, 55, 57, 59, 60, 61, 62, 65, 66, 67, 68, 69, 71, 73, 77, 79, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 96, 97, 99, 101, 102, 103, 107, 109, 110, 111, 113, 114, 115, 116

Offset: 1

Bernard Schott, Mar 05 2021

nonn

Equivalently, numbers m such that tau(m) divides sigma(m) but phi(m) does not divide sigma(m), the corresponding quotients sigma(m)/tau(m) = A102187(m).

Primes in the sequence are primes >= 5; proof: 2 is in A342104 and 3 is in A342103, then for p prime >= 5, phi(p) = p-1 >= 4, tau(p) = 2, sigma(p) = p+1 >= 6; hence 2 divides p+1 but p-1 does not divide p+1.

			Sigma(21) = 32, tau(21) = 4 and phi(21) = 12, hence tau(21) divides sigma(21), but phi(21) does not divide sigma(21), so 21 is a term.

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

Equals A003601 \ A020492.
Cf. A000005 (tau), A000010 (phi), A000203 (sigma), A102187 (sigma/tau).
Cf. A342103, A342104, A342106.

with(numtheory): filter:= q -> (sigma(q) mod tau(q) = 0) and (sigma(q) mod phi(q) <> 0) : select(filter, [$1..120]);

Select[Range[120], Divisible[DivisorSigma[1, #], {DivisorSigma[0, #], EulerPhi[#]}] == {True, False} &] (* Amiram Eldar, Mar 05 2021 *)

isok(m) = my(s=sigma(m)); !(s % numdiv(m)) && (s % eulerphi(m)); \\ Michel Marcus, Mar 05 2021

A334813 Arithmetic numbers k (A003601) such that sigma(k)/d(k) is also an arithmetic number, where d(k) is the number of divisors of k (A000005) and sigma(k) is their sum (A000203).

Original entry on oeis.org

1, 5, 6, 11, 13, 14, 15, 20, 29, 37, 38, 39, 41, 43, 44, 45, 49, 53, 54, 56, 57, 59, 60, 61, 65, 68, 73, 78, 83, 85, 86, 87, 89, 95, 96, 97, 101, 102, 107, 109, 110, 111, 113, 114, 116, 118, 123, 125, 129, 131, 134, 135, 137, 139, 142, 143, 145, 147, 150, 153

Offset: 1

Amiram Eldar, May 12 2020

nonn

The number of terms not exceeding 10^k for k = 1, 2, ... is 3, 36, 426, 4744, 50442, 533806, 5585745, 58013810, 599272790, 6162302702, ... Apparently, this sequence has asymptotic density ~0.6.
Includes all the primes p such that (p+1)/2 is an odd prime, i.e., A005383 without the first term 3.
If p is in A240971 then p^2 is a term.

			5 is a term since sigma(5)/d(5) = 6/2 = 3 is an integer, and so is sigma(3)/d(3) = 4/2 = 2.

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

Cf. A000005, A000203, A003601, A102187.

rat[n_] := DivisorSigma[1, n]/DivisorSigma[0, n]; Select[Range[200], IntegerQ[(r = rat[#])] && IntegerQ[rat[r]] &]

A157846 Numbers which can be a mean of the divisors of some arithmetic number A003601(k).

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19, 20, 21, 22, 24, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 42, 44, 45, 48, 49, 51, 52, 54, 55, 56, 57, 60, 61, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75

Offset: 1

Jaroslav Krizek, Mar 07 2009

nonn

This is A102187 sorted and duplicates removed.

Cf. A102187, A003601, A000203, A000005, A157847.

Edited by R. J. Mathar, Mar 15 2009

A072910 a(n) = sigma(A023883(n)) / tau(A023883(n)).

Original entry on oeis.org

1, 3, 6, 6, 7, 8, 9, 10, 9, 12, 12, 15, 14, 12, 14, 13, 18, 19, 18, 15, 18, 15, 20, 14, 24, 21, 18, 21, 24, 18, 24, 21, 27, 33, 30, 28, 28, 32, 36, 30, 21, 26, 27, 24, 27, 38, 30, 36, 35, 45, 36, 42, 39, 26, 44, 28, 40, 51, 30, 36, 28, 48, 54, 42, 45, 38, 31, 39, 36, 48, 60, 54

Offset: 1

Benoit Cloitre, Aug 10 2002

Arithmetic means of divisors of nonprime arithmetic numbers (A023883). - Amiram Eldar, Jun 06 2020

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

Cf. A000005, A000203, A003601, A102187, A023883.

meanDiv[n_] := DivisorSigma[1, n]/DivisorSigma[0, n]; Select[meanDiv /@ Select[Range[200], !PrimeQ[#] &], IntegerQ] (* Amiram Eldar, Jun 06 2020 *)

f(x) = sigma(x)/numdiv(x);
apply(x->f(x), select(x->((denominator(f(x))==1) && !isprime(x)), [1..1000])) \\ Michel Marcus, Jun 06 2020

A334814 Least number that reaches 1 after n iterations of the map k -> sigma(k)/d(k) if d(k) | sigma(k), and k -> 1 otherwise, where d(k) is the number of divisors of k (A000005) and sigma(k) is their sum (A000203).

Original entry on oeis.org

1, 2, 3, 5, 11, 29, 107, 257, 941, 2017, 11261, 45039, 441073, 2151073, 8575873, 42884161, 220268161, 440536321

Offset: 0

Amiram Eldar, May 12 2020

Apparently, most of the terms are primes. 45039 = 3 * 15013 is the first composite term.

a(18) > 2*10^10, if it exists.

			a(3) = 5 since sigma(5)/d(5) = 6/2 = 3, sigma(3)/d(3) = 4/2 = 2, and sigma(2)/d(2) = 3/2 is not an integer, hence there are 3 iterations: 5 -> 3 -> 2 -> 1, and 5 is the least number with 3 iterations.

Cf. A000005, A000203, A003601, A102187, A330816, A334813.

rat[n_] := If[IntegerQ[r = DivisorSigma[1, n]/DivisorSigma[0, n]], r, 1]; f[n_] := Length @ FixedPointList[rat, n] - 1; max = 10; seq = Table[0, {max}]; c = 0; n = 1; While[c < max, i = f[n]; If[i <= max && seq[[i]] == 0, c++; seq[[i]] = n]; n++]; seq

cp's OEIS Frontend

A003601 Numbers j such that the average of the divisors of j is an integer: sigma_0(j) divides sigma_1(j). Alternatively, numbers j such that tau(j) (A000005(j)) divides sigma(j) (A000203(j)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Maple

Mathematica

PARI

Python

Formula

Extensions

A057660 a(n) = Sum_{k=1..n} n/gcd(n,k).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

PARI

Python

Python

Formula

Extensions

A342103 Balanced numbers (A020492) that are also arithmetic numbers (A003601).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A157847 Numbers which are not a mean of divisors of some arithmetic number A003601(k).

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A342105 Arithmetic numbers (A003601) that are not balanced numbers (A020492).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A334813 Arithmetic numbers k (A003601) such that sigma(k)/d(k) is also an arithmetic number, where d(k) is the number of divisors of k (A000005) and sigma(k) is their sum (A000203).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A157846 Numbers which can be a mean of the divisors of some arithmetic number A003601(k).

Views