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 A130916 #7 Oct 14 2019 14:04:37
%S A130916 1,2,3,4,5,6,8,8,9,10,12,12,15,15,15,16,18,18,20,20,24,24,24,24,25,27,
%T A130916 27,30,30,30,32,32,36,36,36,36,40,40,40,40,45,45,45,45,45,48,48,48,50,
%U A130916 50,54,54,54,54,60,60,60,60,60,60,64,64,64,64,72,72,72,72,72
%N A130916 a(n) = smallest integer >= n which has only prime factors 2, 3 and 5.
%C A130916 This group of sequences is useful when looking for a number >= n to use as the basis for a Fast Fourier Transform when you have n data points.
%H A130916 Harvey P. Dale, <a href="/A130916/b130916.txt">Table of n, a(n) for n = 1..1000</a>
%t A130916 si[n_]:=Module[{k=n},While[Max[FactorInteger[k][[All,1]]]>5,k++];k]; Array[ si,70] (* _Harvey P. Dale_, Oct 14 2019 *)
%o A130916 (R) f <- function(n) nextn(n, factors = c(2,3,5))
%o A130916 a <- matrix(1:256,ncol=1)
%o A130916 apply(a,1,f)
%Y A130916 Cf. A134361, A151969, A151970.
%K A130916 nonn
%O A130916 1,2
%A A130916 _N. J. A. Sloane_, Aug 23 2009