A191363 -id:A191363 - cp's OEIS frontend

A274558 Numbers k such that sigma(k) == 0 (mod k-6).

5, 7, 13, 14, 20, 30, 45, 76, 630, 688, 2310, 8896, 133888, 537051136, 1631268870, 35184418226176, 144115191028645888, 2305843021024854016

Offset: 1

Paolo P. Lava, Jul 05 2016

Contains terms of A141549, odd terms of A141548 multiplied by 2, and 6 times terms of A191363 coprime to 6. - Max Alekseyev, May 25 2025

			sigma(7) mod (7-6) = 8 mod 1 = 0.

Contains subsequence A141549.

Cf. A000203, A045770, A067702, A088833, A141548, A181598, A191363, A274551, A274552, A274553, A274554, A274556, A274557, A274559, A274560, A274561, A274562, A274563, A274564, A274565, A274566.

Select[Range[7, 10^6],  # - 6 != 0 && Mod[DivisorSigma[1, #], # - 6] == 0 &] (* Michael De Vlieger, Jul 05 2016 *)

a(14)-a(15) from Giovanni Resta

Term 5 inserted, a(16)-a(18) added by Max Alekseyev, Jun 04 2025

A295298 Numbers n for which sum of the divisors (A000203) and the binary weight of n (A000120) have the same parity.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 23, 24, 25, 27, 29, 30, 32, 33, 34, 39, 40, 43, 45, 46, 48, 49, 50, 51, 53, 54, 57, 58, 60, 63, 64, 65, 66, 68, 71, 75, 77, 78, 80, 81, 83, 85, 86, 89, 90, 92, 95, 96, 98, 99, 100, 101, 102, 105, 106, 108, 111, 113, 114, 116, 119, 120, 121, 123, 125, 126, 128, 129, 130, 132, 135, 136

Offset: 1

Antti Karttunen, Nov 26 2017

nonn

Numbers n for which A010060(n) = A053866(n).
This sequence is the union of all terms of A028982 (squares and twice squares) that are odious (A000069), and all evil numbers (A001969) that are neither a square or twice a square. See also A231431, A235001.
Sequence A003401 is a subsequence of this sequence. This follows because the only terms in A003401 that are squares or twice squares are the powers of 2 (A000079, that have just one 1-bit, thus are odious), while all the other terms (obtained by multiplying distinct Fermat primes possibly with some power of 2) have an even number of 1-bits, and certainly cannot be squares nor twice squares. - Antti Karttunen, Nov 27 2017

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences related to binary expansion of n

Positions of zeros in A295297.
Complement of A295299.
Cf. A000069, A001969, A000120, A000230, A010060, A028982, A053866, A231431, A235001.
Cf. A000079, A003401, A295296 (subsequences), also A191363 (the five known terms).

Select[Range@ 136, SameQ @@ Map[EvenQ, {DivisorSigma[1, #], DigitCount[#, 2, 1]}] &] (* Michael De Vlieger, Nov 26 2017 *)

A298856 Triangular numbers n for which A240542(n) = A240542(n-1).

Original entry on oeis.org

3, 10, 21, 55, 78, 105, 136, 171, 253, 351, 406, 465, 595, 666, 741, 820, 903, 1081, 1275, 1378, 1711, 1830, 1953, 2211, 2485, 2628, 2775, 2926, 3081, 3403, 3741, 3916, 4465, 4656, 5050, 5253, 5671, 5886, 6105, 6328, 7021, 7503, 7750, 8001, 8515, 9045, 9316, 9591

Offset: 1

Hartmut F. W. Hoft, Jan 27 2018

nonn

Number n is in this sequence exactly when two parts of the symmetric representation of sigma(n) meet at the diagonal.
Proof: If n = k*(2*k+1) is in this sequence then the length of row n in A240542 is 2*k and that of row n-1 is 2*k-1, i.e., the last leg of the Dyck path for n down to the diagonal is vertical and that for n-1 is horizontal to the same point on the diagonal. Therefore, one part of the symmetric representation of sigma(n) ends at the diagonal and so does its symmetric copy. Conversely, if two parts meet at the diagonal then the number of legs in the Dyck path to the diagonal for n, i.e., the length of row n in A240542, is one larger than that for n-1 and must be even, i.e., n has the form n = k*(2*k+1).
A156592 is a subsequence since for every number of the form n = p*(2*p+1) where both p and 2*p+1 are primes A240542(n) = A240542(n-1). For a proof let T(n,k) = ceiling((n+1)/k - (k+1)/2) for 1 <= k <= floor((sqrt(8*n+1) - 1)/2) = 2*p, see A235791; then T(n,k) = T(n-1,k) + 1 for k = 1, 2, p, 2*p, and T(n,k) = T(n-1,k) for all other k. Therefore, the two alternating sums defining A240542(n) and A240542(n-1) are equal, i.e., their Dyck paths meet at the diagonal.
Except for missing 10 the intersection of this sequence and A298855 equals A156592. Sequence A262259 is a subsequence of this sequence.
The five known members of A191363 belong to this sequence, and since their symmetric representation consists of two parts of width one (the respective rows of triangle A237048 have the form 1 0 ... 0 1) they also belong to A262259.
Subsequence of A014105. - Omar E. Pol, Jan 31 2018
Second hexagonal numbers without middle divisors. - Omar E. Pol, Mar 10 2023

			3, 10 and 21 are in the sequence as the illustration of Dyck paths in sequence A237593 shows.
The sequence contains triangular numbers n*(2n+1) where neither n nor 2n+1 are prime. Numbers 1275=25*51 and 2926=38*77 are examples, however, 36 = 4*9 does not belong to the sequence.
78 is the first number in the sequence whose two parts of its symmetric representation contain pieces of width two.

Cf. A000217, A156592, A191363, A237048, A237270, A237593, A240542, A262259, A298855.

Cf. A067742.

(* Function path[] is defined in A237270 *)
meetAtDiagonalQ[n_] := Module[{diags=Transpose[{Drop[Drop[path[n], 1], -1], path[n-1]}]}, Length[Union[diags[[n]]]]==1 && First[diags[[n-1]]]!=Last[diags[[n-1]]]]
a298856[m_, n_] := Select[Map[#(2#+1)&, Range[m, n]], meetAtDiagonalQ]
a298856[1, 70] (* data *)

A056006 Numbers k such that k | sigma(k) + 2.

Original entry on oeis.org

1, 3, 10, 136, 32896, 2147516416

Offset: 1

Robert G. Wilson v, Jul 24 2000

n | sigma(n) gives the multi-perfect numbers A007691, n | sigma(n)+1 if n is a power of 2 (A000079).
This contains A191363 as subsequence, so for any Fermat prime F(k) = 2^2^k+1, the triangular number A000217(2^2^k)=(F(k)-1)*F(k)/2 is in this sequence. See also A055708 which is identical up to the first term. - M. F. Hasler, Oct 02 2014
a(7) > 10^13. - Giovanni Resta, Jul 13 2015
a(7) > 10^18. - Max Alekseyev, May 27 2025

Cf. A000203, A045768, A055708.

Do[If[Mod[DivisorSigma[1, n]+2, n]==0, Print[n]], {n, 1, 7*10^8}]

for(n=1,5e9,if((sigma(n)+2)%n==0,print1(n", "))) \\ Charles R Greathouse IV, Jun 01 2011

a(6) from Charles R Greathouse IV, Jun 01 2011

Edited by M. F. Hasler, Oct 02 2014

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

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.

A387352 Numbers m with deficiency 32: sigma(m) - 2*m = -32.

Original entry on oeis.org

250, 376, 1276, 12616, 20536, 396916, 801376, 1297312, 8452096, 33721216, 40575616, 59376256, 89397016, 99523456, 101556016, 150441856, 173706136, 269096704, 283417216, 500101936, 1082640256, 1846506832, 15531546112, 34675557856, 136310177392, 136783784608

Offset: 1

Max Alekseyev, Aug 27 2025

Contains numbers 2^(k-1)*(2^k + 31) for k in A247952.

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

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), 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), A292626 (k=128).
Cf. A247952.

A217769 Least number k > n such that sigma(k) = 2*(k-n), or 0 if no such k exists.

Original entry on oeis.org

6, 3, 5, 7, 22, 11, 13, 27, 17, 19, 46, 23, 124, 58, 29, 31, 250, 57, 37, 55, 41, 43, 94, 47, 1264, 106, 53, 87, 118, 59, 61, 85, 134, 67, 142, 71, 73, 712, 158, 79, 166, 83, 405, 115, 89, 141, 406, 119, 97, 202, 101, 103, 214, 107, 109, 145, 113, 177, 418, 143

Offset: 0

Jayanta Basu, Mar 28 2013

nonn

a(0) = 6 corresponds to the smallest perfect number.
Is n = 144 the first number for which a(n) = 0? - T. D. Noe, Mar 28 2013
No, a(144) = 95501968. - Giovanni Resta, Mar 28 2013
We can instead compute k - sigma(k)/2 for increasing k, which is computationally much faster. In this case, we stop computing when all n have been found for a range of numbers. - T. D. Noe, Mar 28 2013
Also, the first number whose deficiency is 2n. This is the even bisection of A082730. Hence, the first number in the following sequences: A000396, A191363, A125246, A141548, A125247, A101223, A141549, A141550, A125248, A223608, A223607, A223606. - T. D. Noe, Mar 29 2013
10^12 < a(654) <= 618970019665683124609613824. - Donovan Johnson, Jan 04 2014

			a(4)=22, since 22 is the least number such that sigma(22)=36=2*(22-4).

Donovan Johnson, Table of n, a(n) for n = 0..653 (first 241 terms from T. D. Noe)
Nichole Davis, Dominic Klyve and Nicole Kraght, On the difference between an integer and the sum of its proper divisors, Involve, Vol. 6 (2013), No. 4, 493-504; DOI: 10.2140/involve.2013.6.493.

Cf. A000203, A000396.

Cf. A087998 (negative n).

Table[Min[Select[Range[2000], DivisorSigma[1, #] == 2*(# - i) &]], {i, 0, 60}]
nn = 144; t = Table[0, {nn}]; k = 0; While[k++; Times @@ t == 0, s = (2*k - DivisorSigma[1, k])/2; If[s >= 0 && s < nn && IntegerQ[s] && t[[s + 1]] == 0, t[[s + 1]] = k]]; t (* T. D. Noe, Mar 28 2013 *)

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

Original entry on oeis.org

3, 5, 22, 17, 250, 134, 262, 257, 6556, 4124, 10330, 8198, 91036, 19649, 65542, 65537, 1442716, 524294, 1363258, 4194332, 4411642, 16442342, 16866106, 22075325, 156791188, 536871032, 2160104368, 536870918, 1074187546, 2147483654, 4295862586, 19492545788

Offset: 1

XU Pingya, Sep 19 2017

nonn

Primes of the form 2^n+1, i.e., Fermat primes (A019434) are terms of this sequence.

For n > 32, a(n) > 2 * 10^10.

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

Cf. A019434, A033879, A125246, A125247, A125248, A191363, A275997.

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

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

cp's OEIS Frontend

A274558 Numbers k such that sigma(k) == 0 (mod k-6).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A295298 Numbers n for which sum of the divisors (A000203) and the binary weight of n (A000120) have the same parity.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A298856 Triangular numbers n for which A240542(n) = A240542(n-1).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A056006 Numbers k such that k | sigma(k) + 2.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

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

Views

Author

Keywords

Comments

Crossrefs

A387352 Numbers m with deficiency 32: sigma(m) - 2*m = -32.

Views

Author

Keywords

Comments

Links

Crossrefs

A217769 Least number k > n such that sigma(k) = 2*(k-n), or 0 if no such k exists.

Views

Author

Keywords

Comments

Examples