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 A161657 #19 Apr 17 2022 21:16:16
%S A161657 2,3,4,5,10,7,8,9,14,11,15,13,18,16,16,17,20,19,21,30,26,23,25,25,30,
%T A161657 27,36,29,30,31,32,42,38,36,40,37,42,48,42,41,48,43,52,48,50,47,50,49,
%U A161657 56,60,60,53,55,64,63,66,62,59,60,61,66,70,64,72,80,67,76,78,70,71,75,73
%N A161657 a(n) = the smallest multiple of {the sum of the distinct prime divisors of n} that is >= n.
%C A161657 a(n) = n iff n belongs to A089352. - _Ivan Neretin_, May 25 2016
%H A161657 Ivan Neretin, <a href="/A161657/b161657.txt">Table of n, a(n) for n = 2..10000</a>
%t A161657 Table[Ceiling[#1/#2]*#2 &[n, Plus @@ FactorInteger[n][[All, 1]]], {n, 2, 73}] (* _Ivan Neretin_, May 25 2016 *)
%Y A161657 Cf. A089352, A161656.
%K A161657 nonn
%O A161657 2,1
%A A161657 _Leroy Quet_, Jun 15 2009
%E A161657 More terms from _Sean A. Irvine_, Sep 29 2009