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

A328063 Amicable pairs with the property that the number of divisors of the smaller member is greater than the number of divisors of the larger member.

Original entry on oeis.org

220, 284, 6232, 6368, 12285, 14595, 17296, 18416, 63020, 76084, 69615, 87633, 79750, 88730, 100485, 124155, 122265, 139815, 141664, 153176, 142310, 168730, 185368, 203432, 280540, 365084, 308620, 389924, 319550, 430402, 356408, 399592, 600392, 669688, 609928, 686072, 624184, 691256
Offset: 1

Views

Author

Omar E. Pol, Oct 03 2019

Keywords

Comments

Amicable pairs(x,y) such that d(x) > d(y), where d(n) is the number of divisors of n.

Examples

			Consider the amicable pair [220, 284]. The smaller member has 12 divisors, they are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220. The larger member has 6 divisors, they are 1, 2, 4, 71, 142, 284. The number of divisors of 220 is greater than the number of divisors of 284, so the amicable pair [220, 284] is in the sequence.

Links

Crossrefs

Subsequence of A259180.
Cf. A000005, A002025, A002046, A328009, A328043, A328064, A328065, A328255.

Programs

  • Mathematica
    seq = {}; s[n_] := DivisorSigma[1, n] - n; Do[m = s[n]; If[m > n && s[m] == n && DivisorSigma[0, n] > DivisorSigma[0, m], seq = Join[seq, {n, m}]], {n, 1, 7*10^5}]; seq (* Amiram Eldar, Oct 11 2019 *)

A328064 Amicable pairs with the property that both members have the same number of divisors.

Original entry on oeis.org

1184, 1210, 2620, 2924, 5020, 5564, 10744, 10856, 66928, 66992, 67095, 71145, 122368, 123152, 171856, 176336, 176272, 180848, 196724, 202444, 437456, 455344, 503056, 514736, 522405, 525915, 1077890, 1099390, 1154450, 1189150, 1280565, 1340235, 1358595, 1486845, 1392368, 1464592, 2082464, 2090656
Offset: 1

Views

Author

Omar E. Pol, Oct 03 2019

Keywords

Comments

Amicable pairs(x,y) such that d(x) = d(y), where d(n) is the number of divisors of n.

Examples

			Consider the amicable pair [1184, 1210]. The smaller member has 12 divisors, they are 1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592, 1184. The larger member has 12 divisors, they are 1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605, 1210. The number of divisors of 1184 is equal to the number of divisors of 1210, so the amicable pair [1184, 1210] is in the sequence.

Links

Crossrefs

Subsequence of A259180.
Cf. A000005, A002025, A002046, A328009, A328043, A328063, A328065, A328255.

Programs

  • Mathematica
    seq = {}; s[n_] := DivisorSigma[1, n] - n; Do[m = s[n]; If[m > n && s[m] == n && DivisorSigma[0, n] == DivisorSigma[0, m], seq = Join[seq, {n, m}]], {n, 1, 10^6}]; seq (* Amiram Eldar, Oct 11 2019 *)

A328065 Amicable pairs with the property that the number of divisors of the smaller member is twice the number of divisors of the larger member.

Original entry on oeis.org

220, 284, 12285, 14595, 17296, 18416, 63020, 76084, 69615, 87633, 79750, 88730, 100485, 124155, 122265, 139815, 142310, 168730, 185368, 203432, 308620, 389924, 356408, 399592, 600392, 669688, 609928, 686072, 624184, 691256, 635624, 712216, 643336, 652664, 667964, 783556, 726104, 796696, 898216, 980984
Offset: 1

Views

Author

Omar E. Pol, Oct 03 2019

Keywords

Comments

Amicable pairs(x,y) such that d(x) = 2*d(y), where d(n) is the number of divisors of n.

Examples

			Consider the amicable pair [220, 284]. The smaller member has 12 divisors, they are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220. The larger member has 6 divisors, they are 1, 2, 4, 71, 142, 284. The number of divisors of 220 is twice the number of divisors of 284, so the amicable pair [220, 284] is in the sequence.

Links

Crossrefs

Subsequence of A259180 and of A328063.
Cf. A000005, A002025, A002046, A062011, A328009, A328043, A328064, A328255.

Programs

  • Mathematica
    seq = {}; s[n_] := DivisorSigma[1, n] - n; Do[m = s[n]; If[m > n && s[m] == n && DivisorSigma[0, n] == 2 * DivisorSigma[0, m], seq = Join[seq, {n, m}]], {n, 1, 10^6}]; seq (* Amiram Eldar, Oct 11 2019 *)

A328255 Amicable pairs with the property that the number of divisors of the smaller member is smaller than the number of divisors of the larger member.

Original entry on oeis.org

469028, 486178, 1511930, 1598470, 4246130, 4488910, 5232010, 5799542, 10533296, 10949704, 11693290, 12361622, 20308995, 20955645, 37784810, 39944086, 46991890, 48471470, 48641584, 48852176, 80422335, 82977345, 96304845, 96747315, 103034776, 105016424, 115749344, 116983744, 118458830, 131819506
Offset: 1

Views

Author

Omar E. Pol, Oct 09 2019

Keywords

Comments

Amicable pairs(x,y) such that d(x) < d(y), where d(n) is the number of divisors of n.

Examples

			Consider the amicable pair [469028, 486178]. The smaller member has 18 divisors and the larger member has 36 divisors. 18 is smaller than 36, so the amicable pair [469028, 486178] is in the sequence.

Links

Crossrefs

Subsequence of A259180.
Cf. A000005, A002025, A002046, A328009, A328043, A328063, A328064, A328065.

Extensions

More terms from Amiram Eldar, Oct 09 2019

A328009 Irregular array read by rows in which row n lists the divisors of the n-th term of the sequence of amicable pairs (A259180).

Original entry on oeis.org

1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 1, 2, 4, 71, 142, 284, 1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592, 1184, 1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605, 1210, 1, 2, 4, 5, 10, 20, 131, 262, 524, 655, 1310, 2620, 1, 2, 4, 17, 34, 43, 68, 86, 172, 731, 1462, 2924, 1, 2, 4, 5, 10, 20, 251, 502, 1004, 1255
Offset: 1

Views

Author

Omar E. Pol, Oct 01 2019

Keywords

Comments

Row sums give a sequence formed by the terms of A180164 repeated as follows: 504, 504, 2394, 2394, 5544, 5544, ...

Examples

			Array begins:
1, 2, 4,  5,  10,  11,  20,  22,   44,  55,   110,  220;
1, 2, 4, 71, 142, 284;
1, 2, 4,  8,  16,  32,  37,  74,  148,  296,  592, 1184;
1, 2, 5, 10,  11,  22,  55, 110,  121,  242,  605, 1210;
1, 2, 4,  5,  10,  20, 131, 262,  524,  655, 1310, 2620;
1, 2, 4, 17,  34,  43,  68,  86,  172,  731, 1462, 2924;
1, 2, 4,  5,  10,  20, 251, 502, 1004, 1255, 2510, 5020;
1, 2, 4, 13,  26,  52, 107, 214,  428, 1391, 2782, 5564,
1, 2, 4,  8,  19,  38,  41,  76,   82,  152,  164,  328, 779, 1558, 3116, 6232;
1, 2, 4,  8,  16,  32, 199, 398,  796, 1592, 3184, 6368;
...

Crossrefs

Right border gives A259180 (amicable pairs).
The length of row n is A328043(n).
Column 1 gives A000012.
Cf. A002025, A002046, A018339, A018373, A027750, A180164, A328063, A328064, A328065.

Programs

  • Mathematica
    With[{s = Array[{#, DivisorSigma[1, #] - #} &, 6000]}, Flatten@ Divisors@ DeleteDuplicates[Sort /@ Select[Reverse /@ s, And[! FreeQ[s, #], UnsameQ @@ #] &]]] (* Michael De Vlieger, Oct 08 2019 *)

A339678 Lesser of amicable pair (a, b) such that the sum of their number of divisors d(a) + d(b) sets a new record.

Original entry on oeis.org

220, 1184, 6232, 10744, 12285, 67095, 69615, 522405, 1175265, 1798875, 4482765, 5730615, 9773505, 10634085, 34765731, 203972715, 211319745, 558410475, 1131258975, 2221700481, 3900906009, 4416880923, 9357224877, 36853129467, 139043711025, 200453238531, 200795248485
Offset: 1

Views

Author

Amiram Eldar, Dec 12 2020

Keywords

Comments

The larger counterparts are in A339679.
The corresponding sums of numbers of divisors are 18, 24, 28, 32, 48, 64, 72, ... (see the link for more values).
The terms were calculated using data from Chernykh's site.

Examples

			The least pair of amicable numbers, (220, 284), has a sum of numbers of divisors d(220) + d(284) = 12 + 6 = 18.
The second pair, (1184, 1210) has a larger sum: d(1184) + d(1210) = 12 + 12 = 24.
The next pair with a larger sum is (6232, 6368) whose sum is d(6232) + d(6368) = 16 + 12 = 28.

Links

Crossrefs

Cf. A000005, A002025, A002046, A063990, A328043, A339679.

Programs

  • Mathematica
    s[n_] := DivisorSigma[1, n] - n; dm = 0; seq = {}; Do[m = s[n]; If[m > n && s[m] == n && (d = Plus @@ DivisorSigma[0,{n, m}]) > dm, dm = d; AppendTo[seq, n]], {n,1 ,10^6}]; seq

A339679 Larger of amicable pair (a, b) such that the sum of their number of divisors d(a) + d(b) sets a new record.

Original entry on oeis.org

284, 1210, 6368, 10856, 14595, 71145, 87633, 525915, 1438983, 1870245, 5120595, 6088905, 11791935, 14084763, 36939357, 207429525, 234587199, 662939925, 1337154465, 2450161791, 4024393191, 4785272037, 10162493523, 38437212933, 160412122575, 229777289469, 248806975131
Offset: 1

Views

Author

Amiram Eldar, Dec 12 2020

Keywords

Comments

The terms are ordered according to their lesser counterparts (A339678).
The terms were calculated using data from Chernykh's site.

Links

Crossrefs

Cf. A000005, A002025, A002046, A063990, A328043, A339678.

Programs

  • Mathematica
    s[n_] := DivisorSigma[1, n] - n; dm = 0; seq = {}; Do[m = s[n]; If[m > n && s[m] == n && (d = Plus @@ DivisorSigma[0,{n, m}]) > dm, dm = d; AppendTo[seq, m]], {n,1 ,10^6}]; seq
Showing 1-7 of 7 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.