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 A108698 #11 Oct 07 2020 07:44:15
%S A108698 1,6,11,36,66,121,216,396,726,1296,1331,2376,4356,7776,7986,14256,
%T A108698 14641,26136,46656,47916,85536,87846,156816,161051,279936,287496,
%U A108698 513216,527076,940896,966306,1679616,1724976,1771561,3079296,3162456
%N A108698 Numbers of the form (6^i)*(11^j), with i, j >= 0.
%H A108698 Reinhard Zumkeller, <a href="/A108698/b108698.txt">Table of n, a(n) for n = 1..10000</a>
%F A108698 Sum_{n>=1} 1/a(n) = (6*11)/((6-1)*(11-1)) = 33/25. - _Amiram Eldar_, Oct 07 2020
%F A108698 a(n) ~ exp(sqrt(2*log(6)*log(11)*n)) / sqrt(66). - _Vaclav Kotesovec_, Oct 07 2020
%t A108698 n = 10^6; Flatten[Table[6^i*11^j, {i, 0, Log[6, n]}, {j, 0, Log[11, n/6^i]}]] // Sort (* _Amiram Eldar_, Oct 07 2020 *)
%o A108698 (Haskell)
%o A108698 import Data.Set (singleton, deleteFindMin, insert)
%o A108698 a108698 n = a108698_list !! (n-1)
%o A108698 a108698_list = f $ singleton (1,0,0) where
%o A108698 f s = y : f (insert (6 * y, i + 1, j) $ insert (11 * y, i, j + 1) s')
%o A108698 where ((y, i, j), s') = deleteFindMin s
%o A108698 -- _Reinhard Zumkeller_, May 15 2015
%Y A108698 Cf. A025626, A025627, A025628, A025629, A064476, A107710, A003596, A003597, A107988, A003598, A108687, A003599, A107788, A108090.
%K A108698 nonn,easy
%O A108698 1,2
%A A108698 Douglas Winston (douglas.winston(AT)srupc.com), Jun 19 2005