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 A097650 #10 Mar 28 2015 18:06:37
%S A097650 0,1,1,111,291,651,4251,165751,64101,78501,222501,62501601,62516001,
%T A097650 62660001,2441447211,3922328562757,390625025601,2482366251,2851006251,
%U A097650 62500000160001,390881000001,412041406251,15259444422501,40002500000001
%N A097650 a(n) is the smallest number m such that phi(10^n + m) = 10^n.
%C A097650 a(n) = A097649(n) - 10^n.
%C A097650 phi(10^0+0) = 0, phi(10^1+1)=10 and for n > 0, phi(10^(n+1) + 15*10^n) = 10^(n+1) so for each n, a(n) exists and is less than 25*10^(n-1) + 1. It seems that for n > 0, a(n) mod 10 = 1.
%C A097650 a(11) is greater than 5*10^7.
%F A097650 a[n_]:=(For[m=0, EulerPhi[10^n+m]!=10^n, 1=1, m++ ];m)
%e A097650 a(10)=222501 because phi(10^10+222501)=10^10 and for m < 222501 phi(10^10 + m) != 10^10.
%t A097650 a[n_]:=(For[m=0, EulerPhi[10^n+m]!=10^n, 1=1, m++ ];m);Do[Print[a[n]], {n, 0, 10}]
%t A097650 (* first do *) Needs["DiscreteMath`Combinatorica`"] (* then *) f[n_] := If[n == 0, 1, Block[{p = Select[ Divisors[10^n], PrimeQ[ # + 1] &]}, Min[ Transpose[ Partition[ Flatten[ Table[ Select[ Transpose[{Times @@@ KSubsets[p, i], Times @@@ KSubsets[p + 1, i]}], #[[1]] == 10^n &], {i, 9}]], 2]][[2]] ]]]; Table[ f[n] - 10^n, {n, 0, 23}] (* _Robert G. Wilson v_, Mar 19 2005 *)
%Y A097650 Cf. A097649.
%K A097650 nonn
%O A097650 0,4
%A A097650 _Farideh Firoozbakht_, Sep 05 2004
%E A097650 More terms from _Robert G. Wilson v_, Mar 14 2005