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-3 of 3 results.

A002025 Smaller of an amicable pair: (a,b) such that sigma(a) = sigma(b) = a+b, a < b.

Original entry on oeis.org

220, 1184, 2620, 5020, 6232, 10744, 12285, 17296, 63020, 66928, 67095, 69615, 79750, 100485, 122265, 122368, 141664, 142310, 171856, 176272, 185368, 196724, 280540, 308620, 319550, 356408, 437456, 469028, 503056, 522405, 600392, 609928
Offset: 1

Views

Author

Keywords

Comments

Sometimes called friendly numbers, but this usage is deprecated.
All terms are abundant (A005101). - Michel Marcus, Mar 10 2013
See A125490-A125492 and A137231 for amicable triples, A036471-A036474 and A116148 for amicable quadruples, and A233553 for amicable quintuples. - M. F. Hasler, Dec 14 2013
This sequence is strictly increasing (and A002046, which contains the larger (deficient) number in each pair, is sorted by this sequence). - Jeppe Stig Nielsen, Jan 27 2015
For the related amicable pairs see A259180. - Omar E. Pol, Jul 15 2015
Pomerance (1981) shows that there are at most x*exp(-log(x)^(1/3)) terms of this sequence up to x. In particular, as originally demonstrated by Erdős, this sequence has density 0. - Charles R Greathouse IV, Aug 17 2017

References

  • Mariano Garcia, Jan Munch Pedersen and Herman te Riele, Amicable pairs - a survey, pp. 179-196 in: Alf van der Poorten and Andres Stein (eds.), High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Institute Communications, AMS, Providence RI, 2004.
  • Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 48-49.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Mathematica
    Reap[For[n = 1, n <= 10^6, n++, If[(s = DivisorSigma[1, n]) > 2n && DivisorSigma[1, s - n] == s, Print[n]; Sow[n]]]][[2, 1]] (* Jean-François Alcover, Oct 09 2015, after M. F. Hasler *)
  • PARI
    aliquot(n)=sigma(n)-n
    isA002025(n)={if (n>1, local(a);a=aliquot(n);a>n && aliquot(a)==n)} \\ Michael B. Porter, Apr 11 2010
    
  • PARI
    for(n=1,1e6,(s=sigma(n))>2*n && sigma(s-n)==s && print1(n",")) \\ M. F. Hasler, Dec 14 2013
    
  • PARI
    forfactored(n=1,10^6, t=sigma(n[2])-n[1]; if(t>n[1] && sigma(t)==n[1]+t, print1(n[1]", "))) \\ Charles R Greathouse IV, Aug 17 2017

Formula

a(n) = A259180(2n-1) = A180164(n) - A259180(2n) = A180164(n) - A002046(n). - Omar E. Pol, Jul 15 2015

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Oct 24 2000

A290985 Number of amicable pairs with lesser member at most 2^n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 3, 5, 7, 8, 9, 16, 22, 30, 42, 57, 68, 95, 133, 167, 205, 257, 342, 460, 605, 786, 1043, 1356, 1749, 2294, 2905, 3757, 4811, 6181, 7893, 10146, 13051, 16762, 21396, 27380, 34939, 44449, 56481, 71453, 90783, 115200, 145702, 184045, 232899, 294326, 372216
Offset: 1

Views

Author

Keywords

Comments

Sergei Chernykh led a BOINC project to find a(64) = 2390655. The project took 7 months and used several hundred CPU-years of computation time.

Crossrefs

Programs

  • PARI
    has(n,f=factor(n))=my(t=sigma(f)-n); t>n && sigma(t)==n+t
    a(n)=my(s); forfactored(k=1,2^n, if(has(k[1],k[2]), s++)); s

A360054 Number of odd amicable pairs where the smaller term of the pair is less than 10^n.

Original entry on oeis.org

0, 0, 0, 0, 3, 8, 21, 55, 154, 412, 1088, 2632, 6532, 15371, 35218, 79982, 180061, 402560, 894404, 1975742
Offset: 1

Views

Author

Zoltan Galantai, Jan 23 2023

Keywords

Comments

The list starts with n=1.
Comparing with the numbers of even amicable pairs in A066873, up to 10^4, the proportion of odd amicable pairs is 0%; up to 10^5 it is 23% and up to 10^10 is 28.9%. Up to 10^15, it is 40.4% and up to 10^19 this percentage is 45.9%. It is possible that this trend holds true for more amicable pairs, and thus most amicable number pairs are odd.

References

  • Song Y. Yan, Perfect, Amicable and Sociable Numbers. A Computational Approach, World Scientific, 1996, pages 151 - 153.

Crossrefs

Showing 1-3 of 3 results.