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 A303332 #21 Aug 23 2018 17:05:18
%S A303332 2,3,4,5,6,7,8,9,10,12,14,15,16,21,25,27,28,32,35,36,49,50,54,64,81,
%T A303332 125,126,128,135,189,225,245,250,256,343,375,625,1029,2401,4375
%N A303332 7-smooth numbers representable as the sum of two relatively prime 7-smooth numbers.
%C A303332 It follows from Theorem 6.3 of de Weger's tract that there are exactly 40 terms, the largest of which is 4375 = 1 + 4374 = 5^4 * 7 = 1 + 2 * 3^7.
%C A303332 Indeed, de Weger determined all solutions of the equation x + y = z with x, y, z 13-smooth, x, y relatively prime and x <= y; there exist exactly 545 solutions.
%C A303332 Among them, exactly 63 solutions consist of 7-smooth numbers, which yields exactly 40 terms of this sequence.
%D A303332 T. N. Shorey and R. Tijdeman, Exponential Diophantine Equations, Cambridge University Press, 1986.
%H A303332 B. M. M. de Weger, <a href="https://www.win.tue.nl/~bdeweger/proefschrift.html">Algorithms for Diophantine Equations</a>, Centrum voor Wiskunde en Informatica, Amsterdam, 1989.
%e A303332 a(13) = 16 = 1 + 15 = 7 + 9 = 2^4 = 1 + 3 * 5 = 7 + 3^2.
%e A303332 a(25) = 81 = 1 + 80 = 25 + 56 = 32 + 49 = 3^4 = 1 + 2^4 * 5 = 5^2 + 2^3 * 7 = 2^5 + 7^2.
%t A303332 s7 = Select[Range[10000], FactorInteger[#][[-1, 1]] <= 7 &]; Select[s7, AnyTrue[ IntegerPartitions[#, {2}, s7], GCD @@ # == 1 &] &] (* _Giovanni Resta_, May 30 2018 *)
%Y A303332 Cf. A085153 (subsequence)
%K A303332 nonn,fini,full
%O A303332 1,1
%A A303332 _Tomohiro Yamada_, May 29 2018