A122726 -id:A122726 - cp's OEIS frontend

A001065 Sum of proper divisors (or aliquot parts) of n: sum of divisors of n that are less than n.

0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, 1, 10, 9, 15, 1, 21, 1, 22, 11, 14, 1, 36, 6, 16, 13, 28, 1, 42, 1, 31, 15, 20, 13, 55, 1, 22, 17, 50, 1, 54, 1, 40, 33, 26, 1, 76, 8, 43, 21, 46, 1, 66, 17, 64, 23, 32, 1, 108, 1, 34, 41, 63, 19, 78, 1, 58, 27, 74, 1, 123, 1, 40, 49, 64, 19, 90, 1, 106

Offset: 1

N. J. A. Sloane, R. K. Guy

Also total number of parts in all partitions of n into equal parts that do not contain 1 as a part. - Omar E. Pol, Jan 16 2013
Related concepts: If a(n) < n, n is said to be deficient, if a(n) > n, n is abundant, and if a(n) = n, n is perfect. If there is a cycle of length 2, so that a(n) = b and a(b) = n, b and n are said to be amicable. If there is a longer cycle, the numbers in the cycle are said to be sociable. See examples. - Juhani Heino, Jul 17 2017
Sum of the smallest parts in the partitions of n into two parts such that the smallest part divides the largest. - Wesley Ivan Hurt, Dec 22 2017
a(n) is also the total number of parts congruent to 0 mod k in the partitions of k*n into equal parts that do not contain k as a part (the comment dated Jan 16 2013 is the case for k = 1). - Omar E. Pol, Nov 23 2019
Fixed points are in A000396. - Alois P. Heinz, Mar 10 2024

			x^2 + x^3 + 3*x^4 + x^5 + 6*x^6 + x^7 + 7*x^8 + 4*x^9 + 8*x^10 + x^11 + ...
For n = 44, sum of divisors of n = sigma(n) = 84; so a(44) = 84-44 = 40.
Related concepts: (Start)
From 1 to 17, all n are deficient, except 6 and 12 seen below. See A005100.
Abundant numbers: a(12) = 16, a(18) = 21. See A005101.
Perfect numbers: a(6) = 6, a(28) = 28. See A000396.
Amicable numbers: a(220) = 284, a(284) = 220. See A259180.
Sociable numbers: 12496 -> 14288 -> 15472 -> 14536 -> 14264 -> 12496. See A122726. (End)
For n = 10 the sum of the divisors of 10 that are less than 10 is 1 + 2 + 5 = 8. On the other hand, the partitions of 10 into equal parts that do not contain 1 as a part are [10], [5,5], [2,2,2,2,2], there are 8 parts, so a(10) = 8. - _Omar E. Pol_, Nov 24 2019

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
George E. Andrews, Number Theory. New York: Dover, 1994; Pages 1, 75-92; p. 92 #15: Sigma(n) / d(n) >= n^(1/2).
Carl Pomerance, The first function and its iterates, pp. 125-138 in Connections in Discrete Mathematics, ed. S. Butler et al., Cambridge, 2018.
H. J. J. te Riele, Perfect numbers and aliquot sequences, pp. 77-94 in J. van de Lune, ed., Studieweek "Getaltheorie en Computers", published by Math. Centrum, Amsterdam, Sept. 1980.
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).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 91.

T. D. Noe, Table of n, a(n) for n = 1..10000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972. [alternative scanned copy].
Joerg Arndt, On computing the generalized Lambert series, arXiv:1202.6525v3 [math.CA], (2012).
Henry Bottomley, Illustration of initial terms
K. Chum, R. K. Guy, M. J. Jacobson, Jr., and A. S. Mosunov, Numerical and statistical analysis of aliquot sequences, Exper. Math. 29 (2020), no. 4, 414-425; arXiv:2110.14136, Oct. 2021 [math.NT].
Don Coppersmith, An answer to the problem of Don Saari, 1987.
Paul Erdős, Andrew Granville, Carl Pomerance and Claudia Spiro, On the normal behavior of the iterates of some arithmetic functions, Analytic number theory, Birkhäuser Boston, 1990, pp. 165-204.
Paul Erdős, Andrew Granville, Carl Pomerance and Claudia Spiro, On the normal behavior of the iterates of some arithmetic functions, Analytic number theory, Birkhäuser Boston, 1990, pp. 165-204. [Annotated copy with A-numbers]
Passawan Noppakaew and Prapanpong Pongsriiam, Product of Some Polynomials and Arithmetic Functions, J. Int. Seq. (2023) Vol. 26, Art. 23.9.1.
P. Pollack and C. Pomerance, Some problems of Erdős on the sum-of-divisors function, For Richard Guy on his 99th birthday: May his sequence be unbounded, Trans. Amer. Math. Soc. Ser. B 3 (2016), 1-26; errata.
Carl Pomerance and Hee-Sung Yang, Variant of a theorem of Erdős on the sum-of-proper-divisors function, Math. Comp., to appear (2014).
Primefan, Sums of Restricted Divisors for n=1 to 1000
F. Richman, Aliquot series: Abundant, deficient, perfect
Eric Weisstein's World of Mathematics, Restricted Divisor Function
Eric Weisstein's World of Mathematics, Divisor Function
Index entries for "core" sequences

Least inverse: A070015, A359132.
Values taken: A078923, values not taken: A005114.
Records: A034090, A034091.
First differences: A053246, partial sums: A153485.
a(n) = n - A033879(n) = n + A033880(n). - Omar E. Pol, Dec 30 2013
Row sums of A141846 and of A176891. - Gary W. Adamson, May 02 2010
Row sums of A176079. - Mats Granvik, May 20 2012
Alternating row sums of A231347. - Omar E. Pol, Jan 02 2014
a(n) = sum (A027751(n,k): k = 1..A000005(n)-1). - Reinhard Zumkeller, Apr 05 2013
For n > 1: a(n) = A240698(n,A000005(n)-1). - Reinhard Zumkeller, Apr 10 2014
A134675(n) = A007434(n) + a(n). - Conjectured by John Mason and proved by Max Alekseyev, Jan 07 2015
Cf. A032741, A000203, A048050, A000593, A027750.
Cf. A051953, A051731.
Cf. A037020 (primes), A053868, A053869 (odd and even terms).
Cf. A048138 (number of occurrences), A238895, A238896 (record values thereof).
Cf. A007956 (products of proper divisors).
Cf. A005100, A005101, A000396, A259180, A122726 (related concepts).

a001065 n = a000203 n - n  -- Reinhard Zumkeller, Sep 15 2011

[SumOfDivisors(n)-n: n in [1..100]]; // Vincenzo Librandi, May 06 2015

A001065 := proc(n)
    numtheory[sigma](n)-n ;
end proc:
seq( A001065(n),n=1..100) ;

Table[ Plus @@ Select[ Divisors[ n ], #Zak Seidov, Sep 10 2009 *)
Table[DivisorSigma[1, n] - n, {n, 1, 80}] (* Jean-François Alcover, Apr 25 2013 *)
Array[Plus @@ Most@ Divisors@# &, 80] (* Robert G. Wilson v, Dec 24 2017 *)

numlib::sigma(n)-n$ n=1..81 // Zerinvary Lajos, May 13 2008

{a(n) = if( n==0, 0, sigma(n) - n)} /* Michael Somos, Sep 20 2011 */

from sympy import divisor_sigma
def A001065(n): return divisor_sigma(n)-n # Chai Wah Wu, Nov 04 2022

[sigma(n, 1)-n for n in range(1, 81)] # Stefano Spezia, Jul 14 2025

G.f.: Sum_{k>0} k * x^(2*k)/(1 - x^k). - Michael Somos, Jul 05 2006
a(n) = sigma(n) - n = A000203(n) - n. - Lekraj Beedassy, Jun 02 2005
a(n) = A155085(-n). - Michael Somos, Sep 20 2011
Equals inverse Mobius transform of A051953 = A051731 * A051953. Example: a(6) = 6 = (1, 1, 1, 0, 0, 1) dot (0, 1, 1, 2, 1, 4) = (0 + 1 + 1 + 0 + 0 + 4), where A051953 = (0, 1, 1, 2, 1, 4, 1, 4, 3, 6, 1, 8, ...) and (1, 1, 1, 0, 0, 1) = row 6 of A051731 where the 1's positions indicate the factors of 6. - Gary W. Adamson, Jul 11 2008
a(n) = A006128(n) - A220477(n) - n. - Omar E. Pol Jan 17 2013
a(n) = Sum_{i=1..floor(n/2)} i*(1-ceiling(frac(n/i))). - Wesley Ivan Hurt, Oct 25 2013
Dirichlet g.f.: zeta(s-1)*(zeta(s) - 1). - Ilya Gutkovskiy, Aug 07 2016
a(n) = 1 + A048050(n), n > 1. - R. J. Mathar, Mar 13 2018
Erdős (Elem. Math. 28 (1973), 83-86) shows that the density of even integers in the range of a(n) is strictly less than 1/2. The argument of Coppersmith (1987) shows that the range of a(n) has density at most 47/48 < 1. - N. J. A. Sloane, Dec 21 2019
G.f.: Sum_{k >= 2} x^k/(1 - x^k)^2. Cf. A296955. (This follows from the fact that if g(z) = Sum_{n >= 1} a(n)*z^n and f(z) = Sum_{n >= 1} a(n)*z^(N*n)/(1 - z^n) then f(z) = Sum_{k >= N} g(z^k), taking a(n) = n and N = 2.) - Peter Bala, Jan 13 2021
Faster converging g.f.: Sum_{n >= 1} q^(n*(n+1))*(n*q^(3*n+2) - (n + 1)*q^(2*n+1) - (n - 1)*q^(n+1) + n)/((1 - q^n)*(1 - q^(n+1))^2). (In equation 1 in Arndt, after combining the two n = 0 summands to get -t/(1 - t), apply the operator t*d/dt to the resulting equation and then set t = q and x = 1.) - Peter Bala, Jan 22 2021
a(n) = Sum_{d|n} d * (1 - [n = d]), where [ ] is the Iverson bracket. - Wesley Ivan Hurt, Jan 28 2021
a(n) = Sum_{i=1..n} ((n-1) mod i) - (n mod i). [See also A176079.] - José de Jesús Camacho Medina, Feb 23 2021

A003416 Sociable numbers: smallest member of each cycle (conjectured).

Original entry on oeis.org

12496, 14316, 1264460, 2115324, 2784580, 4938136, 7169104, 18048976, 18656380, 28158165, 46722700, 81128632, 174277820, 209524210, 330003580, 498215416, 805984760, 1095447416, 1236402232, 1276254780, 1799281330

Offset: 1

N. J. A. Sloane

nonn

Numbers belonging to aliquot cycles of length greater than 2.
There is no proof that 564 (for example) is missing from this sequence (cf. A122726). - N. J. A. Sloane, Sep 17 2021
The lengths of the corresponding aliquot cycles are given by A052470. - Michel Marcus, Nov 15 2013

R. K. Guy, Unsolved Problems Number Theory, B7.
Paul Poulet, Parfaits, amiables et extensions, Editions Stevens, Bruxelles, 1918.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 91-92.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers, pp. 174 Penguin Books 1987.

Jeppe Stig Nielsen, Table of n, a(n) for n = 1..53
Shyam Sunder Gupta, Perfect, Multiply Perfect, and Sociable Numbers, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 6, 185-207.
Verner E. Hoggart, Jr., Letters to N. J. A. Sloane, 1974-1975
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 112
David Moews, Perfect, amicable and sociable numbers
David Moews, A list of currently known aliquot cycles of length greater than 2 [This list is not known to be complete.]
Jan O. M. Pedersen, Tables of Aliquot Cycles [Broken link]
Jan O. M. Pedersen, Tables of Aliquot Cycles [Via Internet Archive Wayback-Machine]
Jan O. M. Pedersen, Tables of Aliquot Cycles [Cached copy, pdf file only]
Eric Weisstein's World of Mathematics, Sociable Numbers.

Cf. A052470, A072890, A072891, A122726.

Incorrect g.f. deleted by N. J. A. Sloane, Sep 20 2008

Added "conjectured" to definition. - N. J. A. Sloane, Sep 17 2021

A183019 Conjectured list of multisociable numbers.

Original entry on oeis.org

6, 28, 120, 220, 284, 496, 672, 1184, 1210, 2620, 2924, 5020, 5564, 6232, 6368, 8128, 10744, 10856, 12285, 12496, 14264, 14288, 14536, 14595, 15472, 17296, 18416, 30240, 32760, 63020, 66928, 66992, 67095, 69615, 71145, 76084, 79750, 87633

Offset: 1

William Rex Marshall, Jan 08 2011

nonn

Cf. A000396, A001065, A007691, A063990, A122726, A183013, A183016, A183022, A183029.

A052470 Conjectured orders of sociable numbers A003416.

Original entry on oeis.org

5, 28, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 9, 8, 4, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4

Offset: 1

Eric W. Weisstein

nonn

This is only conjectural, since we don't know that A003416 is complete (cf. A122726). - N. J. A. Sloane, Sep 17 2021

Shyam Sunder Gupta, Perfect, Multiply Perfect, and Sociable Numbers, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 6, 185-207.
Eric Weisstein's World of Mathematics, Sociable Numbers.

Cf. A003416, A122726.

More terms from Eric W. Weisstein, May 22 2006

Edited (including adding "conjectural" to definition) by N. J. A. Sloane, Sep 17 2021

A347770 Conjectured list of numbers which are perfect, amicable, or sociable.

Original entry on oeis.org

6, 28, 220, 284, 496, 1184, 1210, 2620, 2924, 5020, 5564, 6232, 6368, 8128, 10744, 10856, 12285, 12496, 14264, 14288, 14316, 14536, 14595, 15472, 17296, 17716, 18416, 19116, 19916, 22744, 22976, 31704, 45946, 47616, 48976, 63020, 66928, 66992, 67095, 69615, 71145, 76084, 79750

Offset: 1

Eric Chen, Sep 13 2021

nonn

By definition, this is the union of A000396, A259180, and A122726. However, at present A122726 is not known to be complete. There is no proof that 564 (for example) is missing from this sequence. - N. J. A. Sloane, Sep 17 2021
Numbers m for which there exists k>=1 such that s^k(m) = m, where s is A001065.
Conjecture: There are no aliquot cycles containing even numbers and odd numbers simultaneously, i.e., every aliquot cycle either has only even numbers or has only odd numbers.

			Known aliquot cycles (sorted by smallest member):
{6}
{28}
{220, 284}
{496}
{1184, 1210}
{2620, 2924}
{5020, 5564}
{6232, 6368}
{8128}
{10744, 10856}
{12285, 14595}
{12496, 14288, 15472, 14536, 14264}
{14316, 19116, 31704, 47616, 83328, 177792, 295488, 629072, 589786, 294896, 358336, 418904, 366556, 274924, 275444, 243760, 376736, 381028, 285778, 152990, 122410, 97946, 48976, 45946, 22976, 22744, 19916, 17716}
{17296, 18416}
...

David Moews, A list of amicable pairs below 2.01 * 10^11
David Moews, A list of the first 5001 amicable pairs
David Moews, A list of currently known aliquot cycles of length greater than 2 [This list is not known to be complete.]
Jan Munch Pedersen, Tables of Aliquot Cycles (from wayback machine)
Eric Weisstein's World of Mathematics, Perfect number
Eric Weisstein's World of Mathematics, Amicable Pair
Eric Weisstein's World of Mathematics, Sociable Numbers
Wikipedia, Perfect number
Wikipedia, Amicable number
Wikipedia, Sociable number

Cf. A000396, A002025, A002046, A003416, A063990, A122726, A206708, A259180.

Edited with new definition (pointing out that the list is only conjectured to be complete) by N. J. A. Sloane, Sep 17 2021

A292217 Conjectured list of numbers in increasing order that belong to sociable cycles of length greater than 2 in which the sum of the cycle is divisible by 10.

Original entry on oeis.org

1264460, 1305184, 1547860, 1727636, 4938136, 5423384, 5504056, 5753864, 18656380, 20522060, 24289964, 28158165, 28630036, 29902635, 29971755, 30853845, 81128632, 91314968, 91401368, 96389032, 209524210, 230143790, 231439570, 246667790, 498215416, 506040584, 510137384, 583014136

Offset: 1

Zoltan Galantai, Sep 11 2017

This list is not known to be complete (564 might be a member). See A122726. - N. J. A. Sloane, Sep 17 2021

Up to the known 1593 sociable number cycles, 96.1% of the sociable number cycles satisfy this condition (up to the first 10 sociable number cycles: 40%; up to the first 100 sociable number cycles: 77%; up to the first 500 sociable number cycles: 92%, and up to the first 1000 sociable number cycles: 94.9%). So the conjecture here is that as the number of sociable number cycles increases, the percentage of the sums of the sociable number cycles divisible by 10 approaches 100%. Notice that the sums of amicable pairs are similarly often divisible by 10, but are not included here (see A291422).

			The sum of 1264460, 1547860, 1727636 and 1305184 is divisible by ten, thus this sociable number cycle belongs to the sequence. On the other hand, the 12496, 14288, 15472, 14536, 14264 sociable number cycle does not qualify since its sum is 71506.

R. K. Guy, Unsolved Problems in Number Theory, Springer-Verlag, 1994, pp. 62 - 63.
Eric W. Weisstein, CRC Concise Encyclopedia of Mathematics, Chappman and HALL/CRC, 2003, pp. 2747 - 2748.
Song Y. Yan, Perfect, Amicable and Sociable Numbers. A Computation Approach, World Scientific 1996, pp. 34 - 38.

Zoltan Galantai, Table of n, a(n) for n = 1..36
Zoltan Galantai, List of known sociable number cycles where the sums of the cycles is divisible by 10.
Shyam Sunder Gupta, Perfect, Multiply Perfect, and Sociable Numbers, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 6, 185-207.
David Moews, A list of currently known aliquot cycles of length greater than 2 [This list is not known to be complete.]
Eric Weisstein's World of Mathematics, Sociable Numbers

Cf. A122726, A003416, A090615, A119478, A098007, A126016, A063990, A291422.

Changed definition and added comment to point out that this sequence is only conjectural. - N. J. A. Sloane, Sep 17 2021

A309227 Quasi-sociable numbers.

Original entry on oeis.org

1215571544, 1270824975, 1467511664, 1512587175, 1530808335, 1579407344, 1638031815, 1727239544

Offset: 1

Donghwi Park, Jul 16 2019

The smallest quasi-sociable number cycle is {1215571544, 1270824975, 1467511664, 1530808335, 1579407344, 1638031815, 1727239544, 151258717, 1215571544}. They are the only known quasi-sociable numbers in 2019.

a(9) > 10^12, if it exists. - Giovanni Resta, Jul 25 2019

			1215571544 = 2^3 * 11 * 13813313
1270824975 = 3^2 * 5^2 * 7 * 19 * 42467
1467511664 = 2^4 * 19 * 599 * 8059
1530808335 = 3^3 * 5 * 7 * 1619903
1579407344 = 2^4 * 31^2 * 59 * 1741
1638031815 = 3^4 * 5 * 7 * 521 * 1109
1727239544 = 2^3 * 2671 * 80833
1512587175 = 3 * 5^2 * 11 * 1833439

David Moews, Reduced sociable numbers (e-mailed by Mitchell Dickerman on Sep. 10, 1997).

Cf. A122726 (sociable numbers), A005276 (betrothed (or quasi-amicable) numbers).

A347769 a(0) = 0; a(1) = 1; for n > 1, a(n) = A001065(a(n-1)) = sigma(a(n-1)) - a(n-1) (the sum of aliquot parts of a(n-1)) if this is not yet in the sequence; otherwise a(n) is the smallest number missing from the sequence.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 15, 13, 14, 17, 18, 21, 19, 20, 22, 23, 24, 36, 55, 25, 26, 27, 28, 29, 30, 42, 54, 66, 78, 90, 144, 259, 45, 33, 31, 32, 34, 35, 37, 38, 39, 40, 50, 43, 41, 44, 46, 47, 48, 76, 64, 63, 49, 51, 52, 53, 56, 57, 58, 59, 60, 108, 172

Offset: 0

Eric Chen, Sep 13 2021

nonn

This sequence is a permutation of the nonnegative integers iff Catalan's aliquot sequence conjecture (also called Catalan-Dickson conjecture) is true.
a(563) = 276 is the smallest number whose aliquot sequence has not yet been fully determined.
As long as the aliquot sequence of 276 is not known to be finite or eventually periodic, a(563+k) = A008892(k).

			a(0) = 0, a(1) = 1;
since A001065(a(1)) = 0 has already appeared in this sequence, a(2) = 2;
since A001065(a(2)) = 1 has already appeared in this sequence, a(3) = 3;
...
a(11) = 11;
since A001065(a(11)) = 1 has already appeared in this sequence, a(12) = 12;
since A001065(a(12)) = 16 has not yet appeared in this sequence, a(13) = A001065(a(12)) = 16;
since A001065(a(13)) = 15 has not yet appeared in this sequence, a(14) = A001065(a(13)) = 15;
since A001065(a(14)) = 9 has already appeared in this sequence, a(15) = 13;
...

Eric Chen, Table of n, a(n) for n = 0..2703 (all currently known terms, after the b-file of A008892)
Eric Weisstein's World of Mathematics, Aliquot sequence
Eric Weisstein's World of Mathematics, Catalan's Aliquot Sequence Conjecture
Wikipedia, Aliquot sequence

Cf. A032451.
Cf. A001065 (sum of aliquot parts).
Cf. A003023, A044050, A098007, A098008: ("length" of aliquot sequences, four versions).
Cf. A007906.
Cf. A115060 (maximum term of aliquot sequences).
Cf. A115350 (termination of the aliquot sequences).
Cf. A098009, A098010 (records of "length" of aliquot sequences).
Cf. A290141, A290142 (records of maximum term of aliquot sequences).
Cf. A000396, A063990, A122726, A206708, A347770.
Cf. A080907, A063769, A121507, A121508, A131884, A126016.
Aliquot sequences starting at various numbers: A000004 (0), A000007 (1), A033322 (2), A010722 (6), A143090 (12), A143645 (24), A010867 (28), A008885 (30), A143721 (38), A008886 (42), A143722 (48), A143723 (52), A008887 (60), A143733 (62), A143737 (68), A143741 (72), A143754 (75), A143755 (80), A143756 (81), A143757 (82), A143758 (84), A143759 (86), A143767 (87), A143846 (88), A143847 (96), A143919 (100), A008888 (138), A008889 (150), A008890 (168), A008891 (180), A203777 (220), A008892 (276), A014360 (552), A014361 (564), A074907 (570), A014362 (660), A269542 (702), A045477 (840), A014363 (966), A014364 (1074), A014365 (1134), A074906 (1521), A143930 (3630), A072891 (12496), A072890 (14316), A171103 (46758), A072892 (1264460).

A347769_list(N)=print1(0, ", "); if(N>0, print1(1, ", ")); v=[0, 1]; b=1; for(n=2, N, if(setsearch(Set(v), sigma(b)-b), k=1; while(k<=n, if(!setsearch(Set(v), k), b=k; k=n+1, k++)), b=sigma(b)-b); print1(b, ", "); v=concat(v, b))

cp's OEIS Frontend

A001065 Sum of proper divisors (or aliquot parts) of n: sum of divisors of n that are less than n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

MuPAD

PARI

Python

Sage

Formula

A003416 Sociable numbers: smallest member of each cycle (conjectured).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A183019 Conjectured list of multisociable numbers.

Views

Author

Keywords

Crossrefs

A052470 Conjectured orders of sociable numbers A003416.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A347770 Conjectured list of numbers which are perfect, amicable, or sociable.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A292217 Conjectured list of numbers in increasing order that belong to sociable cycles of length greater than 2 in which the sum of the cycle is divisible by 10.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A309227 Quasi-sociable numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A347769 a(0) = 0; a(1) = 1; for n > 1, a(n) = A001065(a(n-1)) = sigma(a(n-1)) - a(n-1) (the sum of aliquot parts of a(n-1)) if this is not yet in the sequence; otherwise a(n) is the smallest number missing from the sequence.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI