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 A246429 #25 May 11 2015 17:19:47
%S A246429 2,3,6,4,12,5,10,15,6,20,7,14,30,21,8,28,35,24,9,42,18,40,10,36,56,45,
%T A246429 30,11,22,63,72,33,12,44,70,55,13,66,90,26,77,60,39,88,14,99,52,84,
%U A246429 110,65,42,15,78,30,91,70,16,104,132,60,117,130
%N A246429 List of c, where c is positive integer solutions of 1/a + 1/b = 1/c and a>b>c and gcd(a,b,c)=1, sorted by ascending a, then b.
%C A246429 For any positive integer m and n, a=m(m+n), b=n(m+n), c=m*n is an integer solution for 1/a+1/b=1/c
%C A246429 See A106430 for list of a, A247372 for list of b.
%H A246429 Ivan Neretin, <a href="/A246429/b246429.txt">Table of n, a(n) for n = 1..10000</a>
%e A246429 1/6 + 1/3 = 1/2.
%e A246429 1/12 + 1/4 = 1/3.
%e A246429 1/15 + 1/10 = 1/6.
%t A246429 aMax = 300;
%t A246429 Select[Sequence @@@ Table[{m (m + n), n (m + n), m n}, {m, Sqrt[aMax]}, {n, Min[m - 1, aMax/m - m]}], GCD @@ # == 1 &] // Sort;
%t A246429 %[[;; , 3]]
%Y A246429 Cf. A106430, A247372.
%K A246429 nonn,look
%O A246429 1,1
%A A246429 _Albert Lau_, Sep 18 2014