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 A036306 #29 May 18 2022 07:56:07
%S A036306 121,671,1331,3721,7271,7381,14641,40321,40931,73271,79981,81191,
%T A036306 122771,161051,177221,183271,226981,406321,436921,443531,450241,
%U A036306 680821,727771,805981,879791,893101,982771,1016321,1227721,1350481,1771561
%N A036306 Composite numbers whose prime factors contain no digits other than 1 and 6.
%C A036306 All terms are a product of at least two terms of A020454. - _David A. Corneth_, Oct 09 2020
%H A036306 David A. Corneth, <a href="/A036306/b036306.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Alois P. Heinz)
%H A036306 <a href="/index/Pri#prime_factors">Index entries for sequences related to prime factors</a>.
%F A036306 Sum_{n>=1} 1/a(n) = Product_{p in A020454} (p/(p - 1)) - Sum_{p in A020454} 1/p - 1 = 0.0112607346... . - _Amiram Eldar_, May 18 2022
%t A036306 pf16Q[n_]:=Module[{pfs=Union[Flatten[IntegerDigits/@Transpose[ FactorInteger[ n]][[1]]]]},pfs=={1}||pfs=={1,6}]; Select[Range[ 2*10^6],CompositeQ[#]&&pf16Q[#]&] (* _Harvey P. Dale_, Jul 12 2014 *)
%Y A036306 Cf. A020454, A036302-A036325.
%K A036306 nonn,easy,base
%O A036306 1,1
%A A036306 _Patrick De Geest_, Dec 15 1998