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 A143512 #19 Apr 29 2023 00:06:17
%S A143512 1,3,5,9,15,17,25,27,45,51,75,81,85,125,135,153,225,243,255,257,289,
%T A143512 375,405,425,459,625,675,729,765,771,867,1125,1215,1275,1285,1377,
%U A143512 1445,1875,2025,2125,2187,2295,2313,2601,3125,3375,3645,3825,3855,4131,4335,4369
%N A143512 Numbers of the form 3^a * 5^b * 17^c * 257^d * 65537^e; products of Fermat primes.
%C A143512 Similar to A004729, which allows each Fermat prime to occur 0 or 1 times. Applying Euler's phi function to these numbers produces numbers in A143513.
%C A143512 If the well-known conjecture that there are only five prime Fermat numbers F_k = 2^(2^k) + 1, k=0,1,2,3,4, is true, then we have exactly Sum_{n>=1} 1/a(n) = Product_{k=0..4} F_k/(F_k-1) = 4294967295/2147483648 = 1.9999999995343387126922607421875. - _Vladimir Shevelev_ and _T. D. Noe_, Dec 01 2010
%H A143512 T. D. Noe, <a href="/A143512/b143512.txt">Table of n, a(n) for n = 1..10000</a>
%t A143512 nn=60; logs=Log[2.,{3,5,17,257,65537}]; lim=Floor[nn/logs]; t={}; Do[z={i,j,k,l,m}.logs; If[z<nn, AppendTo[t,Round[2.^z]]], {i,0,lim[[1]]}, {j,0,lim[[2]]}, {k,0,lim[[3]]}, {l,0,lim[[4]]}, {m,0,lim[[5]]}]; t=Sort[t]
%K A143512 nonn
%O A143512 1,2
%A A143512 _T. D. Noe_, Aug 21 2008