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 A107737 #8 Feb 16 2025 08:32:57
%S A107737 2,6,8,9,14,25,26,30,32,38,40,45,56,63,66,70,74,75,81,86,88,96,99,100,
%T A107737 104,117,121,130,134,136,138,144,147,153,154,158,160,168,174,184,190,
%U A107737 194,196,206,207,216,218,238,248,250,252,254,266,275,279,280,286,289
%N A107737 Numbers n such that, in prime decomposition of n, sum of all prime factors and their orders is prime.
%C A107737 Corresponding primes in A107738. Cf. A008474 If n = Product (p_j^k_j) then a(n) = Sum (p_j + k_j).
%H A107737 Harvey P. Dale, <a href="/A107737/b107737.txt">Table of n, a(n) for n = 1..1000</a>
%H A107737 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeFactorization.html">Prime Factorization</a>
%e A107737 n = 104 OK because 104 = 2^3 * 13^1 => (2+3)+(13+1) = 19 is prime.
%t A107737 ta=Table[Plus @@ Flatten[FactorInteger[n]], {n, 300}];bb={};Do[If[PrimeQ[t=ta[[i]]], bb=Append[bb, {i, t}]], {i, 300}];tr=Transpose[bb];A107738=tr[[2]];A107737=tr[[1]]
%t A107737 Select[Range[2,300],PrimeQ[Total[Flatten[FactorInteger[#]]]]&] (* _Harvey P. Dale_, Feb 05 2017 *)
%Y A107737 Cf. A008474, A107738.
%K A107737 nonn
%O A107737 1,1
%A A107737 _Zak Seidov_, May 23 2005