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 A159237 #6 Jan 22 2016 06:43:47 %S A159237 1,2,3,3,5,5,6,6,7,10,12,11,11,15,16,11,18,14,21,20,25,17,24,30,28,32, %T A159237 28,27,26,19,17,36,26,28,40,23,40,26,23,45,45,48,48,40,44,54,44,34,54, %U A159237 29,45,48,29,54,52,44,51,31,38,65,37,29,57,52,77,78,43,43,88,69,105,105 %N A159237 Composite numbers A046346 divided by the sum of their prime factors (counted with multiplicity). %H A159237 Zak Seidov, <a href="/A159237/b159237.txt">Table of n, a(n) for n=1..1000</a> %F A159237 a(n) = A046346(n)/sopfr(A046346(n)) = A046346(n)/A001414(A046346(n)). %e A159237 n=1: A046346(1)=4, A046346(4)=4, a(1)=4/4=1; %e A159237 n=2: A046346(2)=16, A046346(16)=8, a(2)=16/8=2; %e A159237 n=3: A046346(3)=27, A046346(27)=9, a(3)=27/9=3; %e A159237 n=4: A046346(4)=30, A046346(30)=10, a(4)=30/10=3; %e A159237 n=10: A046346(10)=150, A046346(150)=15, a(10)=150/15=10; %e A159237 n=100: A046346(100)=3840, A046346(3840)=24, a(100)=3840/24=160; %e A159237 n=1000: A046346(1000)=102860, A046346(102860)=185, a(1000)=102860/185=556. %Y A159237 Cf. A046346 Composite numbers that are divisible by the sum of their prime factors (counted with multiplicity), A001414 Integer log of n: sum of primes dividing n (with repetition), sopfr(n), A036844 Numbers n such that n / sopfr(n) is an integer, where sopr() = sum-of-prime-factors, A001414. %K A159237 nonn %O A159237 1,2 %A A159237 _Zak Seidov_, Apr 06 2009