This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A259365 #8 Jun 26 2015 05:09:24 %S A259365 28,139872,2764928,34141176,329774256 %N A259365 Numbers n such that phi(Rev(n)) - phi(n) = n. %C A259365 a(6) > 3*10^10. - _Giovanni Resta_, Jun 26 2015 %F A259365 Solutions of the equation A000010( A004086(n) ) - A000010(n) = n. %e A259365 phi(82) - phi(28) = 40 - 12 = 28; %e A259365 phi(278931) - phi(139872) = 184032 - 44160 = 139872; etc. %p A259365 with(numtheory): T:=proc(w) local x,y,z; x:=w; y:=0; %p A259365 for z from 1 to ilog10(x)+1 do %p A259365 y:=10*y+(x mod 10); x:=trunc(x/10); od; y; end: %p A259365 P:=proc(q) local a,j,k,n; for n from 1 to q do %p A259365 if phi(T(n))-phi(n)=n then print(n); fi; od; end: P(10^9); %Y A259365 Cf. A000010, A004086, A097647. %K A259365 nonn,more,base %O A259365 1,1 %A A259365 _Paolo P. Lava_, Jun 25 2015