OFFSET
1,1
COMMENTS
Consider the digits of the sum of anti-divisors of n. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves.
EXAMPLE
Sum of the anti-divisors of 18 is 28: 2 + 8 = 10, 8 + 10 = 18.
Sum of the anti-divisors of 93 is 140: 1 + 4 + 0 = 5, 4 + 0 + 5 = 9, 0 + 5 + 9 = 14, 5 + 9 + 14 = 28, 9 + 14 + 28 = 51, 14 + 28 + 51 = 93.
MAPLE
with(numtheory): P:=proc(q, h) local a, b, j, k, n, t, v; v:=array(1..h);
for n from 10^6 to q do k:=0; j:=n; while j mod 2 <> 1 do
k:=k+1; j:=j/2; od; a:=sigma(2*n+1)+sigma(2*n-1)+sigma(n/2^k)*2^(k+1)-6*n-2;
b:=ilog10(a)+1; if b>1 then for k from 1 to b do
v[b-k+1]:=(a mod 10); a:=trunc(a/10); od; t:=b+1;
v[t]:=add(v[k], k=1..b); while v[t]<n do t:=t+1; v[t]:=add(v[k], k=t-b..t-1); od;
if v[t]=n then print(n); fi; fi; od; end: P(10^9, 1000);
CROSSREFS
KEYWORD
nonn,base,hard,more
AUTHOR
Paolo P. Lava, Mar 28 2017
EXTENSIONS
a(18)-a(24) from Georg Fischer, Oct 26 2019
STATUS
approved