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 A100390 #17 Dec 12 2021 20:11:33
%S A100390 4,6,8,12,16,18,20,24,27,30,32,36,40,42,45,48,50,52,54,56,60,64,66,68,
%T A100390 70,72,75,77,81,84,88,90,96,98,100,102,105,108,110,112,114,117,120,
%U A100390 125,128,130,132,135,138,140,144,147,150,154,156,160,162,165,168,175,180
%N A100390 Numbers n where A006530 has a local minimum.
%C A100390 Powers of 2 and mostly largest powers of larger primes belong here.
%H A100390 T. D. Noe, <a href="/A100390/b100390.txt">Table of n, a(n) for n = 1..1000</a>
%F A100390 a(n) = A082418(n) + 1. - _T. D. Noe_, Nov 26 2007
%e A100390 Let gpf(n) = A006530(n). 18 is in the sequence because gpf(17) = 17 > gpf(18) = 3 < gpf(19) = 19.
%t A100390 mxp[x_] := Max[FactorInteger[x][[All, 1]]]; ta = {{0}}; Do[s1 = mxp[n - 1]; s = mxp[n]; s2 = mxp[n + 1]; If[Greater[s1, s] && Greater[s2, s], Print[{n, {s1, s, s2}}]; ta = Append[ta, n]], {n, 1, 512}]; ta = Delete[ta, 1] (* Original program edited by _Michael De Vlieger_, Mar 26 2017 *)
%t A100390 With[{n = 181}, Select[MapIndexed[{First@ #2 + 1, Differences@ #1} &, Partition[Array[FactorInteger[#][[-1, 1]] &, n], 3, 1]], Apply[And[#1 < 0, #2 > 0] &, Last@ #] &][[All, 1]]] (* _Michael De Vlieger_, Mar 26 2017 *)
%Y A100390 Cf. A006530.
%K A100390 nonn
%O A100390 1,1
%A A100390 _Labos Elemer_, Dec 14 2004