cp's OEIS Frontend

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.

A259365 Numbers n such that phi(Rev(n)) - phi(n) = n.

Original entry on oeis.org

28, 139872, 2764928, 34141176, 329774256
Offset: 1

Views

Author

Paolo P. Lava, Jun 25 2015

Keywords

Comments

a(6) > 3*10^10. - Giovanni Resta, Jun 26 2015

Examples

			phi(82) - phi(28) = 40 - 12 = 28;
phi(278931) - phi(139872) = 184032 - 44160 = 139872; etc.
		

Crossrefs

Programs

  • Maple
    with(numtheory): T:=proc(w) local x,y,z; x:=w; y:=0;
    for z from 1 to ilog10(x)+1 do
    y:=10*y+(x mod 10); x:=trunc(x/10); od; y; end:
    P:=proc(q) local a,j,k,n; for n from 1 to q do
    if phi(T(n))-phi(n)=n then print(n); fi; od; end: P(10^9);

Formula

Solutions of the equation A000010( A004086(n) ) - A000010(n) = n.