cp's OEIS Frontend

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.

A046347 Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).

This page as a plain text file.
%I A046347 #17 Jun 02 2019 17:06:04
%S A046347 27,105,231,627,805,897,945,1581,1755,2079,2625,2967,3055,3125,3861,
%T A046347 4185,4543,5355,5445,5487,5967,6075,6461,6525,6745,7881,8085,8505,
%U A046347 8883,9555,9717,10125,10647,10707,11375,11385,12675,12789,13005,13275,13475
%N A046347 Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).
%H A046347 T. D. Noe, <a href="/A046347/b046347.txt">Table of n, a(n) for n=1..1000</a>
%e A046347 897 is a term since 897 = 3 * 13 * 23 and 3 + 13 + 23 = 39 and 897 / 39 = 23.
%t A046347 Select[Range[9,13500,2],!PrimeQ[#]&&IntegerQ[#/Total[Times@@@FactorInteger[#]]]&] (* _Jayanta Basu_, Jun 04 2013 *)
%o A046347 (PARI) sopfr(n) = {my(f=factor(n)); sum(k=1, #f~, f[k, 1]*f[k, 2]); } \\ A001414
%o A046347 lista(nn) = forcomposite(n=2, nn, if ((n%2) && !(n % sopfr(n)), print1(n, ", ")); ); \\ _Michel Marcus_, Feb 06 2019
%Y A046347 Cf. A001414, A046346, A046348.
%K A046347 nonn
%O A046347 1,1
%A A046347 _Patrick De Geest_, Jun 15 1998
%E A046347 Name clarified by _Michel Marcus_, Feb 06 2019