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 A225795 #15 Jul 29 2013 11:21:38
%S A225795 2,50,50,60,70,6,2,7600,47,5,4,93,6,34,5,9600,71,4,74,320,3,372,13,
%T A225795 846,32,9600,339,9765,202,3,69,6,9900,13,8586,9600,4,46,3,4,446,3,
%U A225795 9900,4,1256,614,819,3365,8,36400,76,647,35,39548,9900,4740
%N A225795 Smallest k > 1 such that k^n has k as its middle digits, or 0 if no such k exists.
%C A225795 Is a(88) the first 0? If a(88) is nonzero, it is greater than 2 * 10^8. - _T. D. Noe_, Jul 29 2013
%e A225795 a(6) = 6 because 6^6 = 46656 has 6 as its middle digit.
%t A225795 Table[k = 2; While[c0 = IntegerDigits[k]; c1 = IntegerDigits[k^n]; len0 = Length[c0]; len1 = Length[c1]; f = (len1 - len0)/2; ! (OddQ[len0] == OddQ[len1] && c0 == Take[c1, {f + 1, f + len0}]), k++]; k, {n, 56}] (* _T. D. Noe_, Jul 29 2013 *)
%Y A225795 Cf. A062118.
%K A225795 nonn,base
%O A225795 1,1
%A A225795 _Michel Lagneau_, Jul 27 2013
%E A225795 Corrected by _T. D. Noe_, Jul 29 2013