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 A036323 #24 May 22 2022 05:50:03
%S A036323 49,343,2401,5509,6139,6209,16807,38563,42973,43463,55139,62209,
%T A036323 117649,269941,300811,304241,385973,435463,551509,552139,552209,
%U A036323 615139,615209,619369,690199,698069,769129,777899,786769,823543,1889587,2105677
%N A036323 Composite numbers whose prime factors contain no digits other than 7 and 8.
%C A036323 All terms are a product of at least two terms of A020470. - _David A. Corneth_, Oct 09 2020
%H A036323 David A. Corneth, <a href="/A036323/b036323.txt">Table of n, a(n) for n = 1..10000</a>
%H A036323 <a href="/index/Pri#prime_factors">Index entries for sequences related to prime factors</a>.
%F A036323 Sum_{n>=1} 1/a(n) = Product_{p in A020470} (p/(p - 1)) - Sum_{p in A020470} 1/p - 1 = 0.0244618735... . - _Amiram Eldar_, May 22 2022
%t A036323 Select[Range[25*10^5],CompositeQ[#]&&SubsetQ[{7,8},Flatten[ IntegerDigits/@ Transpose[ FactorInteger[#]][[1]]]]&] (* _Harvey P. Dale_, Jan 19 2015 *)
%Y A036323 Cf. A020470, A036302-A036325.
%K A036323 nonn,easy,base
%O A036323 1,1
%A A036323 _Patrick De Geest_, Dec 15 1998