cp's OEIS Frontend

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.

A247372 List of b, where b 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.

This page as a plain text file.
%I A247372 #16 May 11 2015 17:18:02
%S A247372 3,4,10,5,21,6,14,24,7,36,8,18,55,30,9,44,60,33,10,78,22,65,11,52,105,
%T A247372 70,39,12,26,112,136,42,13,60,119,80,14,102,171,30,126,85,48,152,15,
%U A247372 180,68,133,210,90,51,16,114,34,140,95,17,168,253,76,198,230
%N A247372 List of b, where b 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 A247372 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 A247372 See A106430 for list of a, A246429 for list of c.
%H A247372 Ivan Neretin, <a href="/A247372/b247372.txt">Table of n, a(n) for n = 1..10000</a>
%e A247372 1/6 + 1/3 = 1/2.
%e A247372 1/12 + 1/4 = 1/3.
%e A247372 1/15 + 1/10 = 1/6.
%t A247372 aMax = 300;
%t A247372 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 A247372 %[[;;, 2]]
%Y A247372 Cf. A106430, A246429.
%K A247372 nonn,look
%O A247372 1,1
%A A247372 _Albert Lau_, Sep 14 2014