|
|
A137205
|
|
Numbers k such that abundance(k) + abundance(k+1) = 2.
|
|
0
|
|
|
215, 923, 944, 1455, 2379, 5355, 6467, 6623, 14099, 23495, 196343, 212795, 1661135, 4070199, 4160919, 4626699, 60464627, 217408415, 248621603, 262792907, 265371335, 613033667, 684241907, 1065360113, 3148946723, 4773647871, 6729842063, 19910536424
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The abundance of k is defined as the difference between the sum of the aliquot parts of k and k itself.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
abundance(215) = (sum of aliquot parts of 215) - 215 = 49 - 215 = -166;
abundance(216) = (sum of aliquot parts of 216) - 216 = 384 -216 = 168;
so abundance(215) + abundance(216) = 2.
|
|
MAPLE
|
with(numtheory): a:=proc(n) if sigma(n)+sigma(n+1)-4*n=4 then n end if end proc: seq(a(n), n=1..100000); # Emeric Deutsch, Apr 02 2008
|
|
MATHEMATICA
|
Select[Range[10^6], DivisorSigma[1, #] + DivisorSigma[1, # + 1] - 4 # == 4 &] (* Michael De Vlieger, Feb 02 2019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|