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 A134618 #19 Mar 25 2025 10:49:00
%S A134618 12,28,40,45,48,52,54,56,63,75,80,96,104,108,117,136,152,153,165,175,
%T A134618 210,224,232,245,250,261,268,300,320,325,333,344,350,363,384,387,390,
%U A134618 399,405,416,432,462,464,468,475,477,504,507,531,536,539,561,570,584
%N A134618 Numbers such that the sum of cubes of their prime factors (taken with multiplicity) is a prime.
%H A134618 Harvey P. Dale and Hieronymus Fischer, <a href="/A134618/b134618.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from _Harvey P. Dale_)
%F A134618 {k: A224787(k) in A000040}. - _R. J. Mathar_, Mar 25 2025
%e A134618 a(2) = 28, since 28 = 2*2*7 and 2^3 + 2^3 + 7^3 = 359 which is prime.
%t A134618 Select[Range[600],PrimeQ[Total[Flatten[Table[#[[1]],{#[[2]]}]&/@ FactorInteger[#]]^3]]&] (* _Harvey P. Dale_, Feb 01 2013 *)
%o A134618 (Python)
%o A134618 from sympy import factorint, isprime
%o A134618 def ok(n): return isprime(sum(p**3 for p in factorint(n, multiple=True)))
%o A134618 print([k for k in range(585) if ok(k)]) # _Michael S. Branicky_, Dec 28 2021
%Y A134618 Cf. A001597, A025475, A134333, A134344, A134376.
%Y A134618 Cf. A134600, A134602, A134605, A134608, A134612, A134616, A134620.
%K A134618 nonn
%O A134618 1,1
%A A134618 _Hieronymus Fischer_, Nov 11 2007
%E A134618 Example clarified by _Harvey P. Dale_, Feb 01 2013
%E A134618 Minor edits by _Hieronymus Fischer_, May 06 2013