cp's OEIS Frontend

A250067 Numbers n such that n = Rev(sigma*(n)), where sigma*(n) is the sum of the anti-divisors of n and Rev(n) is the reverse of n.

%I A250067 #8 Dec 07 2014 02:27:12
%S A250067 5,8,64,614,47678,4442395
%N A250067 Numbers n such that n = Rev(sigma*(n)), where sigma*(n) is the sum of the anti-divisors of n and Rev(n) is the reverse of n.
%e A250067 Anti-divisors of 5 are 2, 3 and 2 + 3 = 5 = Rev(5).
%e A250067 Anti-divisors of 614 are 3, 4, 409 and 3 + 4 + 409 = 416 = Rev(614).
%p A250067 with(numtheory):T:=proc(w) local x,y,z; x:=w; y:=0;
%p A250067 for z from 1 to ilog10(x)+1 do y:=10*y+(x mod 10); x:=trunc(x/10); od; y; end:
%p A250067 P:=proc(q) local j,k,n; for n from 1 to q do
%p A250067 k:=0; j:=n; while j mod 2 <> 1 do k:=k+1; j:=j/2; od;
%p A250067 if sigma(2*n+1)+sigma(2*n-1)+sigma(n/2^k)*2^(k+1)-6*n-2=T(n);
%p A250067 then print(n); fi; od; end: P(10^9);
%Y A250067 Cf. A000203, A066417, A178029, A248787.
%K A250067 nonn,base,more
%O A250067 1,1
%A A250067 _Paolo P. Lava_, Nov 11 2014
%E A250067 a(6) from _Chai Wah Wu_, Dec 06 2014