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 A164788 #19 Sep 08 2022 08:45:47
%S A164788 1,15,45,75,135,183,225,285,295,354,357,375,405,429,510,549,583,675,
%T A164788 708,799,855,910,943,1020,1055,1062,1071,1125,1215,1266,1287,1416,
%U A164788 1425,1454,1475,1527,1530,1634,1647,1820,1875,2025,2040,2124,2499,2532,2550,2565
%N A164788 Numbers such that the sum of the distinct prime factors is a cube.
%C A164788 This is the 3rd row of the infinite array A(k,n) = n-th positive integer such that the sum of the distinct prime factors is of the form j^k for integers j, k. The 2nd row is A164722.
%C A164788 If k >= 1 and p = (2*k)^3 - 5 is prime (see A200957) then 5*p is a term. - _Marius A. Burtea_, Jun 30 2019
%H A164788 Harvey P. Dale, <a href="/A164788/b164788.txt">Table of n, a(n) for n = 1..1000</a>
%F A164788 {n such that A008472(n) = k^3 for k an integer}. {n such that A008472(n) is in A000578}.
%e A164788 a(2) = 15 because 15 = 3 * 5, the sum of distinct prime factors being 3+5 = 8 = 2^3. a(5) = 183 = 3 * 61 because 3 + 61 = 64 = 4^3. a(7) = 285 because 285 = 3 * 5 * 19 and 3 + 5 + 19 = 27 = 3^3.
%t A164788 Select[Range[3000],IntegerQ[Surd[Total[Transpose[FactorInteger[#]][[1]]],3]]&] (* _Harvey P. Dale_, Jun 21 2013 *)
%o A164788 (Magma) [n:n in [1..2600]| IsPower(&+PrimeDivisors(n), 3)]; // _Marius A. Burtea_, Jun 30 2019
%Y A164788 Cf. A000578, A008472, A164722.
%K A164788 easy,nonn
%O A164788 1,2
%A A164788 _Jonathan Vos Post_, Aug 26 2009
%E A164788 More terms from _Jon E. Schoenfield_, May 27 2010