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 A190116 #24 Sep 30 2019 03:14:49
%S A190116 0,2,3,16,5,30,7,96,54,70,11,192,13,126,120,512,17,378,19,480,210,286,
%T A190116 23,1056,250,390,729,896,29,930,31,2560,462,646,420,2160,37,798,624,
%U A190116 2720,41,1722,43,2112,1755,1150,47,5376,686,2250
%N A190116 a(n) = n*n', where n' is the arithmetic derivative (A003415) of n.
%C A190116 Sequence is not injective. 4153248 is the smallest number that occurs more than once, as a(1368) and as a(2277). See example in A327861. - _Antti Karttunen_, Sep 29 2019
%H A190116 G. C. Greubel, <a href="/A190116/b190116.txt">Table of n, a(n) for n = 1..10000</a>
%F A190116 a(n) = A085731(n) * A086130(n). - _Michel Marcus_, Oct 24 2013
%e A190116 For n=4, 4'= 4, 4*4' = 16, so a(4)=16.
%p A190116 der:=n->n*add(op(2,p)/op(1,p),p=ifactors(n)[2]):
%p A190116 seq(der(n)*n,n=1..50);
%t A190116 A003415[n_]:= If[Abs@n < 2, 0, n Total[#2/#1 & @@@FactorInteger[Abs@n]]]; Table[n*A003415[n], {n, 1, 50}] (* _G. C. Greubel_, Dec 29 2017 *)
%o A190116 (PARI) a(n) = n*sum(i=1, #f=factor(n)~, n/f[1, i]*f[2, i]); \\ _Michel Marcus_, Dec 30 2017
%Y A190116 Cf. A003415, A327861 (number of times n occurs in this sequence).
%K A190116 nonn
%O A190116 1,2
%A A190116 _Giorgio Balzarotti_, May 04 2011