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 A374589 #10 Jul 14 2024 08:52:55
%S A374589 16,48,80,81,112,144,162,176,208,240,256,272,304,324,336,368,400,405,
%T A374589 432,464,496,512,528,560,567,592,624,625,648,656,688,720,752,768,784,
%U A374589 810,816,848,880,891,912,944,976,1008,1040,1053,1072,1104,1134,1136,1168,1200
%N A374589 Numbers whose maximum exponent in their prime factorization is a powerful number larger than 1.
%C A374589 Subsequence of A130897 and first differs from it at n = 115: A130897(115) = 2592 = 2^5 * 3^4 is not a term of this sequence.
%C A374589 The asymptotic density of this sequence is d = Sum_{k > 1 and in A001694} (1/zeta(k+1) - 1/zeta(k)) = 0.043523813088759413253... . The asymptotic density of this sequence within A130897 is d/(1 - A262276) = 0.98744988886705430331... .
%H A374589 Amiram Eldar, <a href="/A374589/b374589.txt">Table of n, a(n) for n = 1..10000</a>
%t A374589 powQ[n_] := Min[FactorInteger[n][[;; , 2]]] > 1; q[n_] := powQ[Max[ FactorInteger[n][[;; , 2]] ]]; Select[Range[1200], q]
%o A374589 (PARI) ispow(n) = n > 1 && ispowerful(n);
%o A374589 is(n) = n > 1 && ispow(vecmax(factor(n)[, 2]))
%Y A374589 Cf. A001694, A051903, A262276, A361177.
%Y A374589 Subsequence of A013929, A130897 and A372405.
%Y A374589 Similar sequences: A368714, A369937, A369938, A369939, A374588, A374590.
%K A374589 nonn,easy
%O A374589 1,1
%A A374589 _Amiram Eldar_, Jul 12 2024