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 A119416 #10 Sep 16 2015 11:52:27
%S A119416 2,6,15,12,35,30,77,24,45,70,143,60,221,154,105,48,323,90,437,140,231,
%T A119416 286,667,120,175,442,135,308,899,210,1147,96,429,646,385,180,1517,874,
%U A119416 663,280,1763,462,2021,572,315,1334,2491,240,539,350,969,884,3127,270
%N A119416 n * (smallest prime greater than largest prime factor of n).
%C A119416 a(n) = n * A117366(n);
%C A119416 A000005(a(n)) = 2*A000005(n) = A062011(n).
%H A119416 Reinhard Zumkeller, <a href="/A119416/b119416.txt">Table of n, a(n) for n = 1..10000</a>
%F A119416 a(n) = n * A151800(A006530(n)). - _Reinhard Zumkeller_, Apr 06 2015
%e A119416 a(10) = (2*5)*7.
%t A119416 Insert[Table[n*Prime[PrimePi[FactorInteger[n][[ -1]][[1]]] + 1],{n,2,100}], 2, 1] (* _Stefan Steinerberger_, May 18 2006 *)
%o A119416 (Haskell)
%o A119416 a119416 n = n * (a151800 $ a006530 n) -- _Reinhard Zumkeller_, Apr 06 2015
%Y A119416 Cf. A006530, A087560.
%Y A119416 Cf. A151800.
%K A119416 nonn
%O A119416 1,1
%A A119416 _Reinhard Zumkeller_, May 17 2006