A088831 -id:A088831 - cp's OEIS frontend

A077374 Odd numbers m whose abundance by absolute value is at most 10, that is, -10 <= sigma(m) - 2m <= 10.

1, 3, 5, 7, 9, 11, 15, 21, 315, 1155, 8925, 32445, 442365, 815634435

Offset: 1

Jason Earls, Nov 30 2002

Apart from {1, 3, 5, 7, 9, 11, 15, 21, 315}, subset of A088012. Probably finite. - Charles R Greathouse IV, Mar 28 2011
a(15) > 10^13. - Giovanni Resta, Mar 29 2013
The abundance of the given terms a(1..14) is: (-1, -2, -4, -6, -5, -10, -6, -10, -6, -6, 6, 6, 6, -6). See also A171929, A188263 and A188597 for numbers with abundancy sigma(n)/n close to 2. - M. F. Hasler, Feb 21 2017
a(15) > 10^22. - Wenjie Fang, Jul 13 2017

			sigma(32445) = 64896 and 32445*2 = 64890, which makes the odd number 32445 six away from perfection: A(32445) = 6 and hence in this sequence.

Eric Weisstein's World of Mathematics, Abundance.

Contains odd terms of: A191363, A088831, A125246, A088832, A141548, A087167, A125247, A088833, A101223, A223609.

Cf. A033879, A033880, A000203, A088012.

Select[Range[1, 10^6, 2], -10 <= DivisorSigma[1, #] - 2 # <= 10 &] (* Michael De Vlieger, Feb 22 2017 *)

forstep(n=1,442365,2,if(abs(sigma(n)-2*n)<=10,print1(n,",")))

a(14) from Farideh Firoozbakht, Jan 12 2004

A088833 Numbers n whose abundance is 8: sigma(n) - 2n = 8.

Original entry on oeis.org

56, 368, 836, 11096, 17816, 45356, 77744, 91388, 128768, 254012, 388076, 2087936, 2291936, 13174976, 29465852, 35021696, 45335936, 120888092, 260378492, 381236216, 775397948, 3381872252, 4856970752, 6800228816, 8589344768, 44257207676, 114141404156

Offset: 1

Labos Elemer, Oct 28 2003

nonn

A subset of A045770.
If p=2^m-9 is prime (m is in the sequence A059610) then n=2^(m-1)*p is in the sequence. See comment lines of the sequence A088831. 56, 368, 128768, 2087936 & 8589344768 are of the mentioned form. - Farideh Firoozbakht, Feb 15 2008
a(28) > 10^12. - Donovan Johnson, Dec 08 2011
a(31) > 10^13. - Giovanni Resta, Mar 29 2013
a(38) > 10^18. - Hiroaki Yamanouchi, Aug 23 2018
Any term x of this sequence can be combined with any term y of A125247 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. - Timothy L. Tiffin, Sep 13 2016

			Except first 4 terms of A045770 (1, 7, 10, and 49) are here: abundances = {-1,-6,-2,-41,8,8,8,8,8,8,8,8,8,8,8,8,8}.

Giovanni Resta and Hiroaki Yamanouchi, Table of n, a(n) for n = 1..37 (terms a(1)-a(30) from _Giovanni Resta_)

Cf. A033880, A045668, A045669, A045770, A088831, A088832, A059610, A125247 (deficiency 8).

Do[If[DivisorSigma[1,n]==2n+8,Print[n]],{n,100000000}] (* Farideh Firoozbakht, Feb 15 2008 *)

is(n)=sigma(n)==2*n+8 \\ Charles R Greathouse IV, Feb 21 2017

a(14)-a(17) from Farideh Firoozbakht, Feb 15 2008
a(18)-a(25) from Donovan Johnson, Dec 23 2008
a(26)-a(27) from Donovan Johnson, Dec 08 2011

A191363 Numbers m such that sigma(m) = 2*m - 2.

Original entry on oeis.org

3, 10, 136, 32896, 2147516416

Offset: 1

Luis H. Gallardo, May 31 2011

Let k be a nonnegative integer such that F(k) = 2^(2^k) + 1 is prime (a Fermat prime A019434), then m = (F(k)-1)*F(k)/2 appears in the sequence.
Conjecture: a(1)=3 is the only odd term of the sequence.
Conjecture: All terms of the sequence are of the above form derived from Fermat primes.
The sequence has 5 (known) terms in common with sequences A055708 (k-1 | sigma(k)) and A056006 (k | sigma(k)+2) since {a(n)} is a subsequence of both.
The first five terms of the sequence are respectively congruent to 3, 4, 4, 4, 4 modulo 6.
After a(5) there are no further terms < 8*10^9.
Up to m = 1312*10^8 there are no further terms in the class congruent to 4 modulo 6.
a(6) > 10^12. - Donovan Johnson, Dec 08 2011
a(6) > 10^13. - Giovanni Resta, Mar 29 2013
a(6) > 10^18. - Hiroaki Yamanouchi, Aug 21 2018
See A125246 for numbers with deficiency 4, i.e., sigma(m) = 2*m - 4, and A141548 for numbers with deficiency 6. - M. F. Hasler, Jun 29 2016 and Jul 17 2016
A term m of this sequence multiplied by a prime p not dividing it is abundant if and only if p < m-1. For each of a(2..5) there is such a prime near this limit (here: 7, 127, 30197, 2147483647) such that a(k)*p is a primitive weird number, cf. A002975. - M. F. Hasler, Jul 19 2016
Any term m of this sequence can be combined with any term j of A088831 to satisfy the property (sigma(m) + sigma(j))/(m+j) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. [Proof: If m = a(n) and j = A088831(k), then sigma(m) = 2m-2 and sigma(j) = 2j+2. Thus, sigma(m) + sigma(j) = (2m-2) + (2j+2) = 2m + 2j = 2(m+j), which implies that (sigma(m) + sigma(j))/(m+j) = 2(m+j)/(m+j) = 2.] - Timothy L. Tiffin, Sep 13 2016
At least the first five terms are a subsequence of A295296 and of A295298. - David A. Corneth, Antti Karttunen, Nov 26 2017
Conjectures: all terms are second hexagonal numbers (A014105). There are no terms with middle divisors. - Omar E. Pol, Oct 31 2018
The symmetric representation of sigma(m) of each of the 5 numbers in the sequence consists of 2 parts of width 1 that meet at the diagonal (subsequence of A246955). - Hartmut F. W. Hoft, Mar 04 2022
The first five terms coincide with the sum of two successive terms of A058891. The same is not true for a(6), if such exists. - Omar E. Pol, Mar 03 2023

			For n=1, a(1) = 3 since sigma(3) = 4 = 2*3 - 2.

Gianluca Amato, Maximilian Hasler, Giuseppe Melfi, and Maurizio Parton, Primitive weird numbers having more than three distinct prime factors, Riv. Mat. Univ. Parma, 7(1), (2016), 153-163, arXiv:1803.00324 [math.NT], 2018.

Cf. A000203, A002975, A056006, A055708, A088831 (abundance 2).
Cf. A033880, A125246 (deficiency 4), A141548 (deficiency 6), A125247 (deficiency 8), A125248 (deficiency 16).
Cf. A295296, A295298.
Cf. A014105, A237593, A246955.
Cf. A058891.

[n: n in [1..9*10^6] | (SumOfDivisors(n)-2*n) eq -2]; // Vincenzo Librandi, Sep 15 2016

ok[n_] := DivisorSigma[1,n] == 2*n-2; Select[ Table[ 2^(2^k-1) * (2^(2^k)+1), {k, 0, 5}], ok] (* Jean-François Alcover, Sep 14 2011, after conjecture *)
Select[Range[10^6], DivisorSigma[1, #] == 2 # - 2 &] (* Michael De Vlieger, Sep 14 2016 *)

zp(a,b) = {my(c,c1,s); c = a; c1 = 2*c-2;
while(c

a(k)=(2^2^k+1)<<(2^k-1) \\ For k<6. - M. F. Hasler, Jul 27 2016

a(n) = (A019434(n)-1)*A019434(n)/2 for all terms known so far. - M. F. Hasler, Jun 29 2016

A088832 Numbers k whose abundance is 4: sigma(k) - 2*k = 4.

Original entry on oeis.org

12, 70, 88, 1888, 4030, 5830, 32128, 521728, 1848964, 8378368, 34359083008, 66072609790, 549753192448, 259708613909470, 2251799645913088, 9223372026117357568

Offset: 1

Labos Elemer, Oct 28 2003

If 2^m-5 is prime (A059608) then n=2^(m-1)*(2^m-5) is in the sequence. 12, 88, 1888, 32128, 521728, 8378368 & 34359083008 are such terms. See comments in A088831. - Farideh Firoozbakht, Feb 15 2008
Any term x of this sequence can be combined with any term y of A125246 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. - Timothy L. Tiffin, Sep 13 2016
Also contains 865268370658615254581248 = 2^23 * 16823249 * 6131278669. - Max Alekseyev, May 29 2025

			Abundances of terms in A045769: {-5,4,4,4,4,4,4,4,4,4} so A045769(1)=9 is not here.

Subsequence of A045769.

Cf. A033880, A045768, A088830, A059608, A125246 (deficiency 4).

Do[If[DivisorSigma[1,n]==2n+4,Print[n]],{n,650000000}] (* Farideh Firoozbakht, Feb 15 2008 *)

is(n)=sigma(n)==2*n+4 \\ Charles R Greathouse IV, Feb 21 2017

Solutions to sigma(x)-2*x=4.

One more terms from Farideh Firoozbakht, Feb 15 2008
a(11)-a(12) from Donovan Johnson, Dec 23 2008
a(13) from Donovan Johnson, Dec 08 2011
a(14)-a(15) from Hiroaki Yamanouchi, Aug 23 2018
a(16) from Max Alekseyev, May 29 2025

A275996 Numbers n whose abundance is 64: sigma(n) - 2n = 64.

Original entry on oeis.org

108, 220, 6808, 8968, 14008, 24448, 66928, 552568, 786208, 1020568, 5303488, 8229568, 10001848, 133685248, 499722448, 2608895488, 4733164768, 7163795488, 13707973408, 14468025568, 16122444736, 27339731968, 34351218688, 34672397728, 35371084288, 69657461248

Offset: 1

Timothy L. Tiffin, Aug 16 2016

Any term x = a(m) of this sequence can be used with any term y of A275997 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable.
The smallest amicable pair is (220, 284) = (a(2), A275997(2)) = (A063990(1), A063990(2)), where 284 - 220 = 64 is the abundance of 220 and the deficiency of 284.
The amicable pair (66928, 66992) = (a(7), A275997(11)) = (A063990(18), A063990(19)), and 66992 - 66928 = 64 is the abundance of 66928 and the deficiency of 66992.

			a(1) = 108, since sigma(108) - 2*108 = 280 - 216 = 64.

Max Alekseyev, Table of n, a(n) for n = 1..63

Subsequence of A005101.

Cf. A002025, A063990, A275997, A088831, A088832, A088833, A141547, A175989, A275701, A066539, A259180.

isok(n) = sigma(n) - 2*n == 64; \\ Michel Marcus, Dec 30 2016

a(14)-a(15) from Michel Marcus, Dec 30 2016
a(16)-a(21) from Lars Blomberg, Jan 12 2017
Terms a(22) onward from Max Alekseyev, Aug 27 2025

A272553 Numbers n whose sum of divisors equals the sum of divisors of 2n+1.

Original entry on oeis.org

20, 464, 650, 2744, 3980, 5504, 5736, 5922, 7032, 8130, 10472, 18618, 24312, 27654, 38874, 39500, 43032, 45492, 56870, 64410, 71058, 79068, 85158, 89178, 92130, 97014, 109928, 117114, 118902, 127688, 130304, 175554, 180438, 187304, 188292, 208452, 224058, 244674, 249788, 269192, 294380, 305624, 347964

Offset: 1

Waldemar Puszkarz, May 02 2016

nonn

Most terms are even; the first three odd ones are 1264545, 8770125, and 9346995, and these are the only odd terms among the first 10^7 numbers  that include  135 terms.
For some n, 2n+1 is prime; for example, this is so for the first three terms, but this happens rarely with only 4 cases among the first 10^7 numbers.
All terms are abundant numbers (A005101): since sigma(x)>x for x>1, sigma(2n+1)>2n+1>2n for n>0, the defining formula, sigma(n)=sigma(2n+1), implies sigma(n)>2n, which proves that n is an abundant number.
Up to 6*10^9 there are 1151 terms, 46 of which are odd. All these odd terms are multiple of 3 and all are multiple of 5, except 1501989489 and 4242679749. The values n for which 2n+1 is a prime number are a subset of A088831, thus it is easy to verify that up to 10^13 there are only 4 such values (20, 464, 650, and 130304). - Giovanni Resta, May 03 2016

			20 is a term as its sum of divisors, 42=1+2+4+5+10+20, is the same as the sum of divisors of 41=2*20+1; 41 has only two divisors 1 and 41.

Giovanni Resta, Table of n, a(n) for n = 1..1000

Cf. A000203 (sum of divisors), A074821 (similar sequence for the number of divisors), A005101 (abundant numbers, supersequence), A088831,

select(t -> numtheory:-sigma(t) = numtheory:-sigma(2*t+1), [$1..10^6]); # Robert Israel, May 03 2016

Select[Range@500000, DivisorSigma[1, #]==DivisorSigma[1, 2*#+1]&]

for (n=1, 500000, (sigma(n)==sigma(2*n+1)) && print1(n ", "))

A000203(n) = A000203(2n+1).

A275997 Numbers k whose deficiency is 64: 2k - sigma(k) = 64.

Original entry on oeis.org

134, 284, 410, 632, 1292, 1628, 4064, 9752, 12224, 22712, 66992, 72944, 403988, 556544, 2161664, 2330528, 8517632, 13228352, 14563832, 15422912, 20732792, 89472632, 134733824, 150511232, 283551872, 537903104, 731670272, 915473696, 1846850576, 2149548032, 2159587616

Offset: 1

Timothy L. Tiffin, Aug 16 2016

Any term x = a(m) in this sequence can be used with any term y in A275996 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable.
The smallest amicable pair is (220, 284) = (A275996(2), a(2)) = (A063990(1), A063990(2)), where 284 - 220 = 64 is the abundance of 220 and the deficiency of 284.
The amicable pair (66928, 66992) = (A275996(7), a(11)) = (A063990(18), A063990(19)), where 66992 - 66928 = 64 is the deficiency of 66992 and the abundance of 66928.
Contains numbers 2^(k-1)*(2^k + 63) whenever 2^k + 63 is prime. - Max Alekseyev, Aug 27 2025

			a(1) = 134, since 2*134 - sigma(134) = 268 - 204 = 64.

Max Alekseyev, Table of n, a(n) for n = 1..89

Deficiency k: A191363 (k=2), A125246 (k=4), A141548 (k=6), A125247 (k=8), A101223 (k=10), A141549 (k=12), A141550 (k=14), A125248 (k=16), A223608 (k=18), A223607 (k=20), A223606 (k=22), A385255(k=24), A275702 (k=26), A387352 (k=32).
Abundance k: A088831 (k=2), A088832 (k=4), A087167 (k=6), A088833 (k=8), A223609 (k=10), A141545 (k=12), A141546 (k=14), A141547 (k=16), A223610 (k=18), A223611 (k=20), A223612 (k=22), A223613 (k=24), A275701 (k=26), A175989 (k=32), A275996 (k=64), A292626 (k=128).
Cf. A002025, A063990.

Select[Range[10^7], 2 # - DivisorSigma[1, #] == 64 &] (* Michael De Vlieger, Jan 10 2017 *)

isok(n) = 2*n - sigma(n) == 64; \\ Michel Marcus, Dec 30 2016

a(23)-a(31) from Jinyuan Wang, Mar 02 2020

A292626 Numbers k whose abundance is 128: sigma(k) - 2*k = 128.

Original entry on oeis.org

860, 5336, 6536, 9656, 16256, 55796, 70864, 98048, 361556, 776096, 2227616, 4145216, 4498136, 4632896, 8124416, 13086016, 34869056, 38546576, 150094976, 172960856, 196066256, 962085536, 1080008576, 1733780336, 1844788112, 2143256576, 2531343872, 2986104064, 9677743616, 11276687456, 17104503968, 20680182272, 21568135616

Offset: 1

Fabian Schneider, Sep 20 2017

Max Alekseyev, Table of n, a(n) for n = 1..87

Subsequence of A259174.
Deficiency k: A191363 (k=2), A125246 (k=4), A141548 (k=6), A125247 (k=8), A101223 (k=10), A141549 (k=12), A141550 (k=14), A125248 (k=16), A223608 (k=18), A223607 (k=20), A223606 (k=22), A385255(k=24), A275702 (k=26), A387352 (k=32), A275997 (k=64).
Abundance k: A088831 (k=2), A088832 (k=4), A087167 (k=6), A088833 (k=8), A223609 (k=10), A141545 (k=12), A141546 (k=14), A141547 (k=16), A223610 (k=18), A223611 (k=20), A223612 (k=22), A223613 (k=24), A275701 (k=26), A175989 (k=32), A275996 (k=64).

fQ[n_] := DivisorSigma[1, n] == 2 n + 128; Select[ Range@ 10^8, fQ] (* Robert G. Wilson v, Nov 19 2017 *)

isok(n) = sigma(n) - 2*n == 128; \\ Michel Marcus, Sep 20 2017

a(9)-a(18) from Michel Marcus, Sep 20 2017
a(19)-a(24), a(26), a(29)-a(30), a(33) from Robert G. Wilson v, Nov 20 2017
Missing terms a(25), a(27)-a(28), a(31)-a(32) inserted and terms a(34) onward added by Max Alekseyev, Aug 30 2025

A292558 a(n) is the smallest number k such that sigma(k) - 2k = 2^n.

Original entry on oeis.org

20, 12, 56, 550, 572, 108, 860, 952, 1232, 6328, 3708, 40540, 37072, 79288, 327260, 357112, 302000, 527296, 1764056, 6506512, 38559776, 21893248, 42257216, 167771740, 90798560, 469761208, 508198064, 490304800, 1353048560, 2951488480, 5067417200, 32648918272, 40086360272

Offset: 1

XU Pingya, Sep 19 2017

For n > 31, a(n) > 1.724 * 10^10.

a(1) = A088831(1), a(2) = A088832(1), a(3) = A088833(1), a(4) = A141547(1), a(5) = A175989(1), a(6) = A275996(1), a(7) = A292626(1). - Max Alekseyev, Aug 27 2025

			sigma(20) - 2*20 = 2^1, a(1) = 20.
sigma(108) - 2*108 = 64 = 2^6, a(6) = 108.

Max Alekseyev, Table of n, a(n) for n = 1..50

Cf. A000203, A033880, A088831, A088832, A088833, A141547, A175989, A275996.

Table[k = 1; While[Log[2, DivisorSigma[1, k] - 2k] != n, k++]; k, {n, 30}]

a(n) = my(k=1); while(sigma(k) - 2*k != 2^n, k++); k; \\ Michel Marcus, Sep 19 2017

Terms a(32) onward from Max Alekseyev, Aug 27 2025

A385255 Numbers m whose deficiency is 24: sigma(m) - 2*m = -24.

Original entry on oeis.org

124, 9664, 151115727458150838697984

Offset: 1

Max Alekseyev, Jul 29 2025

Contains numbers 2^(k-1)*(2^k + 23) for k in A057203. First three terms have this form.

Deficiency k: A191363 (k=2), A125246 (k=4), A141548 (k=6), A125247 (k=8), A101223 (k=10), A141549 (k=12), A141550 (k=14), A125248 (k=16), A223608 (k=18), A223607 (k=20), A223606 (k=22), A275702 (k=26).
Abundance k: A088831 (k=2), A088832 (k=4), A087167 (k=6), A088833 (k=8), A223609 (k=10), A141545 (k=12), A141546 (k=14), A141547 (k=16), A223610 (k=18), A223611 (k=20), A223612 (k=22), A223613 (k=24), A275701 (k=26).
Cf. A057203.

cp's OEIS Frontend

A077374 Odd numbers m whose abundance by absolute value is at most 10, that is, -10 <= sigma(m) - 2m <= 10.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A088833 Numbers n whose abundance is 8: sigma(n) - 2n = 8.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A191363 Numbers m such that sigma(m) = 2*m - 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A088832 Numbers k whose abundance is 4: sigma(k) - 2*k = 4.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A275996 Numbers n whose abundance is 64: sigma(n) - 2n = 64.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A272553 Numbers n whose sum of divisors equals the sum of divisors of 2n+1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A275997 Numbers k whose deficiency is 64: 2k - sigma(k) = 64.

Views

Author

Keywords

Comments