|
|
A057710
|
|
Positive integers k with exactly 2 aliquot sequence predecessors. In other words, there are exactly two solutions x for which s(x) = n. The function s(x) here is the sum of all proper divisors of x (A001065).
|
|
6
|
|
|
6, 8, 13, 14, 15, 16, 17, 19, 20, 22, 23, 27, 29, 32, 42, 44, 46, 50, 54, 62, 69, 90, 92, 100, 104, 108, 110, 114, 130, 136, 148, 150, 152, 156, 166, 170, 176, 182, 184, 186, 198, 200, 202, 214, 230, 232, 234, 236, 240, 242, 244, 254, 258, 266, 272, 280, 286
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
14 is a member of the sequence because s(22) = 14 and s(169) = 14 (and because no other integer x satisfies s(x) = 14).
|
|
MATHEMATICA
|
len = max = 57; f[_List] := (s = Select[ Split[ Sort[ Table[ DivisorSigma[1, n] - n, {n, 1, max *= 2}]]], Length[#] == 2 & ][[All, 1]]; s [[1 ;; Min[len, Length[s]]]]); FixedPoint[f, {}] (* Jean-François Alcover, Oct 07 2011 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|