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 A336063 #15 Aug 31 2020 18:45:39 %S A336063 2,3,4,5,6,7,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,26,27,28,29, %T A336063 30,31,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,50,51,52,53,54, %U A336063 55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,71,72,73,74 %N A336063 Numbers divisible by the minimal exponent in their prime factorization (A051904). %C A336063 The asymptotic density of this sequence is 1 (Schinzel and Šalát, 1994). %D A336063 József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, chapter 3, p. 331. %H A336063 Amiram Eldar, <a href="/A336063/b336063.txt">Table of n, a(n) for n = 1..10000</a> %H A336063 Andrzej Schinzel and Tibor Šalát, <a href="https://dml.cz/handle/10338.dmlcz/136624">Remarks on maximum and minimum exponents in factoring</a>, Mathematica Slovaca, Vol. 44, No. 5 (1994), pp. 505-514. %e A336063 4 = 2^2 is a term since A051904(4) = 2 is a divisor of 4. %t A336063 h[1] = 0; h[n_] := Min[FactorInteger[n][[;; , 2]]]; Select[Range[2, 100], Divisible[#, h[#]] &] %t A336063 Select[Range[2,100],Divisible[#,Min[FactorInteger[#][[All,2]]]]&] (* _Harvey P. Dale_, Aug 31 2020 *) %o A336063 (PARI) isok(m) = if (m>1, (m % vecmin(factor(m)[,2])) == 0); \\ _Michel Marcus_, Jul 08 2020 %Y A336063 Cf. A051904, A124184. %Y A336063 A005117 (except for 1) is subsequence. %Y A336063 Similar sequences: A033950, A005349, A006446, A074946, A075592, A007694, A112249, A336064. %K A336063 nonn %O A336063 1,1 %A A336063 _Amiram Eldar_, Jul 07 2020