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 A225425 #7 May 24 2013 00:43:45
%S A225425 1,6,31,120,418,1268,3499,8987,22316,51677,116978,252856,528275,
%T A225425 1075319,2131671,4119410,7801334,14482065
%N A225425 Number of "abc-hits" with c < 10^n.
%C A225425 Let rad(x) be the function that computes the squarefree kernel of x (see A007947). A triple {a,b,c} of positive integers with a+b=c, gcd(a,b)=1 and c > rad(a*b*c) is called an abc-hit.
%C A225425 The first 6 terms were computed using A130510. More terms were found on the Wikipedia page.
%H A225425 Wikipedia, <a href="http://en.wikipedia.org/wiki/Abc_conjecture">abc conjecture</a>
%e A225425 The only solution under 10 is 1 + 8 = 9.
%Y A225425 Cf. A130510, A130511, A130512 (c, a, and rad(a*b*c)).
%Y A225425 Cf. A225426 (a,b,c in one sequence).
%K A225425 nonn,base,hard,more
%O A225425 1,2
%A A225425 _T. D. Noe_, May 22 2013