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 A365866 #14 Apr 27 2025 00:46:04
%S A365866 8,16,24,27,32,40,48,56,64,72,80,81,88,96,104,112,120,125,128,135,136,
%T A365866 144,152,160,168,176,184,189,192,200,208,216,224,232,240,243,248,256,
%U A365866 264,272,280,288,296,297,304,312,320,328,336,343,344,351,352,360,368,376
%N A365866 Integers that are divisible by the cube of their least prime factor.
%C A365866 Numbers k such that A067029(k) >= 3.
%C A365866 The asymptotic density of terms with least prime factor prime(n) (within all the positive integers) is d(n) = (1/prime(n)^3) * Product_{k=1..(n-1)} (1-1/prime(k)). For example, for n = 1, 2, 3, 4, 5 and 6, d(n) = 1/8, 1/54, 1/375, 4/5145, 8/46585 and 16/169169.
%C A365866 The asymptotic density of this sequence is Sum_{n>=1} d(n) = 0.147333958520714364623977...
%H A365866 Amiram Eldar, <a href="/A365866/b365866.txt">Table of n, a(n) for n = 1..10000</a>
%e A365866 8 is a term since 2 is the least prime factor of 8 and 8 is divisible by 2^3 = 8.
%t A365866 Select[Range[400], FactorInteger[#][[1, -1]] >= 3 &]
%o A365866 (PARI) is(n) = n > 1 && factor(n)[1,2] >= 3;
%Y A365866 Cf. A020639, A067029.
%Y A365866 Subsequence of A046099 and A283050.
%Y A365866 Subsequences: A365867, A365868.
%K A365866 nonn,easy
%O A365866 1,1
%A A365866 _Amiram Eldar_, Sep 21 2023