Smallest n-digit number m such that phi(10^n+1)=phi(m), gcd(10^n+1,m)=1 and 10 does not divide m, or zero if there is no such m.
A147547
Smallest n-digit number m such that phi(10^n+1)=phi(m), gcd(10^n+1,m)=1 and 10 does not divide m, or zero if there is no such m.
Terms
- a(0) =0a(1) =0a(2) =779a(3) =9991a(4) =90901a(5) =990001a(6) =9090901a(7) =94139561a(8) =681465373a(9) =9898047311a(10) =86925973487a(11) =979104060601
External references
- oeis: A147547