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 A084791 #11 Aug 11 2025 15:45:35
%S A084791 1,4,7,8,10,14,19,21,24,28,29,30,34,35,36,38,39,41,42,43,45,46,50,51,
%T A084791 53,54,58,59,63,67,68,72,78,82,88,99,110,113,115,118,120,122,125,127,
%U A084791 133,135,138,140,146,148,154,160,162,168,175,176,177,183,190,191,192
%N A084791 Where record gaps between 3-smooth numbers occur.
%H A084791 Amiram Eldar, <a href="/A084791/b084791.txt">Table of n, a(n) for n = 1..10000</a>
%H A084791 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SmoothNumber.html">Smooth Number</a>
%F A084791 A084788(n) = A061987(a(n)).
%F A084791 A084789(n) = A003586(a(n)).
%F A084791 A084790(n) = A003586(a(n) + 1).
%t A084791 s = {}; m = 13; Do[n = 3^k; While[n <= 3^m, AppendTo[s, n]; n*=2], {k, 0, m}]; s = Union[s]; d = Differences@s; v = DeleteDuplicates @ FoldList[Max, d]; Map[First@ Position[d, #] &, v] //Flatten (* _Amiram Eldar_, Jan 30 2020 *)
%t A084791 Module[{nn=10^7,ts},ts=Select[Range[nn],Max[FactorInteger[#][[;;,1]]]<5&];DeleteDuplicates[Thread[{Range[Length[ts]-1],Differences[ts]}],GreaterEqual[#1[[2]],#2[[2]]]&]][[;;,1]] (* The program generates the first 58 terms of the sequence. *) (* _Harvey P. Dale_, Aug 11 2025 *)
%Y A084791 Cf. A003586, A084788, A084789, A084790.
%K A084791 nonn
%O A084791 1,2
%A A084791 _Reinhard Zumkeller_, Jun 03 2003