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 A374588 #14 Jul 14 2024 08:53:08
%S A374588 16,48,64,80,81,112,144,162,176,192,208,240,256,272,304,320,324,336,
%T A374588 368,400,405,432,448,464,496,512,528,560,567,576,592,624,625,648,656,
%U A374588 688,704,720,729,752,768,784,810,816,832,848,880,891,912,944,960,976,1008
%N A374588 Numbers whose maximum exponent in their prime factorization is a composite number.
%C A374588 Subsequence of A322448 and first differs from it at n = 138: A322448(138) = 2592 = 2^5 * 3^4 is not a term of this sequence.
%C A374588 The asymptotic density of this sequence is d = Sum_{k composite} (1/zeta(k+1) - 1/zeta(k)) = 0.05296279266796920306... . The asymptotic density of this sequence within the nonsquarefree numbers (A013929) is d / (1 - 1/zeta(2)) = 0.13508404411123191108... .
%H A374588 Amiram Eldar, <a href="/A374588/b374588.txt">Table of n, a(n) for n = 1..10000</a>
%p A374588 filter:= proc(n) local m;
%p A374588 m:= max(ifactors(n)[2][..,2]);
%p A374588 m > 1 and not isprime(m)
%p A374588 end proc:
%p A374588 select(filter, [$1..10000]); # _Robert Israel_, Jul 14 2024
%t A374588 Select[Range[1200], CompositeQ[Max[FactorInteger[#][[;; , 2]]]] &]
%o A374588 (PARI) iscomposite(n) = n > 1 && !isprime(n);
%o A374588 is(n) = n > 1 && iscomposite(vecmax(factor(n)[, 2]));
%Y A374588 Cf. A002808, A013661, A051903, A229099.
%Y A374588 Complement of A074661 within A013929.
%Y A374588 Subsequence of A322448 and A322449 \ {1}.
%Y A374588 Similar sequences: A368714, A369937, A369938, A369939, A374589, A374590.
%K A374588 nonn,easy
%O A374588 1,1
%A A374588 _Amiram Eldar_, Jul 12 2024