cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A223612 Numbers k whose abundance is 22: sigma(k) - 2*k = 22.

Original entry on oeis.org

1312, 29824, 8341504, 134029312, 34356723712
Offset: 1

Views

Author

Donovan Johnson, Mar 23 2013

Keywords

Comments

a(6) > 10^12.
a(6) > 10^13. - Giovanni Resta, Mar 29 2013
a(6) > 10^18. - Hiroaki Yamanouchi, Aug 23 2018
Any term x of this sequence can be combined with any term y of A223606 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. [Proof: If x = a(n) and y = A223606(m), then sigma(x) = 2x+22 and sigma(y) = 2y-22. Thus, sigma(x)+sigma(y) = (2x+22)+(2y-22) = 2x+2y = 2(x+y), which implies that (sigma(x)+sigma(y))/(x+y) = 2(x+y)/(x+y) = 2.] - Timothy L. Tiffin, Sep 13 2016
a(6) <= 2361183240644548624384. Every number of the form 2^(j-1)*(2^j - 23), where 2^j - 23 is prime, is a term. - Jon E. Schoenfield, Jun 02 2019

Examples

			For k = 34356723712, sigma(k) - 2*k = 22.
		

Crossrefs

Cf. A000203, A033880, A223606 (deficiency 22).

Programs

  • Magma
    [n: n in [1..9*10^6] | (SumOfDivisors(n)-2*n) eq 22]; // Vincenzo Librandi, Sep 14 2016
  • Mathematica
    Select[Range[1, 10^6], DivisorSigma[1, #] - 2 # == 22 &] (* Vincenzo Librandi, Sep 14 2016 *)
  • PARI
    for(n=1, 10^8, if(sigma(n)-2*n==22, print1(n ", ")))
    

Extensions

Name edited by Timothy L. Tiffin, Sep 10 2023

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

Views

Author

Timothy L. Tiffin, Aug 16 2016

Keywords

Comments

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

Examples

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

Crossrefs

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).

Programs

  • Mathematica
    Select[Range[10^7], 2 # - DivisorSigma[1, #] == 64 &] (* Michael De Vlieger, Jan 10 2017 *)
  • PARI
    isok(n) = 2*n - sigma(n) == 64; \\ Michel Marcus, Dec 30 2016

Extensions

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

Views

Author

Fabian Schneider, Sep 20 2017

Keywords

Crossrefs

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).

Programs

  • Mathematica
    fQ[n_] := DivisorSigma[1, n] == 2 n + 128; Select[ Range@ 10^8, fQ] (* Robert G. Wilson v, Nov 19 2017 *)
  • PARI
    isok(n) = sigma(n) - 2*n == 128; \\ Michel Marcus, Sep 20 2017

Extensions

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

Views

Author

Max Alekseyev, Jul 29 2025

Keywords

Comments

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

Crossrefs

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

Views

Author

Max Alekseyev, Aug 27 2025

Keywords

Comments

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

Crossrefs

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

Views

Author

Jayanta Basu, Mar 28 2013

Keywords

Comments

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

Examples

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

Crossrefs

Cf. A087998 (negative n).

Programs

  • Mathematica
    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 *)
Showing 1-6 of 6 results.