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 A046364 #12 Aug 14 2024 12:42:49 %S A046364 45,63,75,99,117,147,153,165,175,207,245,273,279,325,333,345,369,385, %T A046364 399,405,423,435,475,477,507,549,561,567,595,603,651,657,665,675,715, %U A046364 747,759,775,777,795,833,845,847,867,873,885,891,903,909,925,927,957 %N A046364 Odd composite numbers whose sum of prime factors is prime (counted with multiplicity). %p A046364 isA046364 := proc(n) %p A046364 if isprime(n) then %p A046364 false; %p A046364 else %p A046364 isprime(A001414(n)) %p A046364 end if; %p A046364 end proc: %p A046364 for n from 3 to 1001 by 2 do %p A046364 if isA046364(n) then %p A046364 printf("%d,",n) ; %p A046364 end if; %p A046364 end do: # _R. J. Mathar_, Aug 14 2024 %t A046364 Select[Range[1,957,2], !PrimeQ[#] && PrimeQ[Total[Times@@@FactorInteger[#]]]&] (* _Jayanta Basu_, May 29 2013 *) %Y A046364 Cf. A046363, A046365. %K A046364 nonn %O A046364 0,1 %A A046364 _Patrick De Geest_, Jun 15 1998