cp's OEIS Frontend

A248787 Numbers x such that sigma(x) = rev(sigma*(x)), where sigma(x) is the sum of the divisors of x, sigma*(x) the sum of the anti-divisors of x and rev(x) the reverse of x.

%I A248787 #18 Mar 18 2015 02:34:14
%S A248787 20,26,36531,42814,4513010,63033577
%N A248787 Numbers x such that sigma(x) = rev(sigma*(x)), where sigma(x) is the sum of the divisors of x, sigma*(x) the sum of the anti-divisors of x and rev(x) the reverse of x.
%C A248787 No further terms up to 10^6.
%C A248787 a(7) > 10^10. - _Hiroaki Yamanouchi_, Mar 18 2015
%H A248787 Diana Mecum, <a href="/A130799/a130799.txt">Anti-divisors from 3 to 500</a>
%e A248787 Antidivisors of 20 are 3,8,13 and their sum is 24, while sigma(20) = 42.
%e A248787 Antidivisors of 26 are 3,4,17 and their sum is 24, while sigma(26) = 42.
%e A248787 Antidivisors of 36531 are 2, 6, 18, 22, 54, 66, 82, 162, 198, 246, 594, 738, 902, 1782, 2214, 2706, 6642, 8118, 24354 and their sum is sigma*(36531) = 48906, while sigma(36531) = 60984.
%p A248787 with(numtheory):T:=proc(w) local x,y,z; y:=w; z:=0;
%p A248787 for x from 1 to ilog10(w)+1 do z:=10*z+(y mod 10); y:=trunc(y/10); od; z; end:
%p A248787 P:=proc(q) local a,j,k,n; for n from 1 to q do
%p A248787 k:=0; j:=n; while j mod 2 <> 1 do k:=k+1; j:=j/2; od;
%p A248787 a:=sigma(2*n+1)+sigma(2*n-1)+sigma(n/2^k)*2^(k+1)-6*n-2;
%p A248787 if T(a)=sigma(n) then print(n); fi; od; end: P(10^10);
%o A248787 (PARI) rev(n) = subst(Polrev(digits(n)), x, 10);
%o A248787 sad(n) = k=valuation(n, 2); sigma(2*n+1)+sigma(2*n-1)+sigma(n/2^k)*2^(k+1)-6*n-2;
%o A248787 isok(n) = sigma(n) == rev(sad(n)); \\ _Michel Marcus_, Dec 07 2014
%Y A248787 Cf. A000203, A066417, A178029.
%K A248787 nonn,base,more
%O A248787 1,1
%A A248787 _Paolo P. Lava_, Oct 14 2014
%E A248787 a(5) from _Chai Wah Wu_, Dec 06 2014
%E A248787 a(6) from _Hiroaki Yamanouchi_, Mar 18 2015