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 A099310 #9 Sep 30 2017 23:47:54 %S A099310 0,0,1,1,4,1,5,4,5,4,7,4,16,5,12,12,32,5,21,12,16,7,13,12,24,16,21,16, %T A099310 32,12,31,32,24,32,44,16,60,21,44,32,68,16,41,24,44,13,25,32,41,24,80, %U A099310 44,56,21,68,44,60,32,31,32,92,31,60,80,112,24,61,80,48,44,59,44,156,60 %N A099310 Arithmetic derivative of Euler's totient function phi(n). %D A099310 See A003415 %H A099310 Michel Marcus, <a href="/A099310/b099310.txt">Table of n, a(n) for n = 1..5000</a> %F A099310 a(n) = A003415(A000010(n)) %t A099310 dn[0]=0; dn[1]=0; dn[n_]:=Module[{f=Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Plus@@(n*f[[2]]/f[[1]])]]; Table[dn[EulerPhi[n]], {n, 100}] %o A099310 (GAP) %o A099310 A099310:= Concatenation([0,0],List(List(List([3..10^3], n->Phi(n)),Factors),i->Product(i)*Sum(i,j->1/j))); # _Muniru A Asiru_, Sep 27 2017 %o A099310 (PARI) ad(n) = sum(i=1, #f=factor(n)~, n/f[1, i]*f[2, i]); %o A099310 a(n) = ad(eulerphi(n)); \\ _Michel Marcus_, Sep 29 2017 %Y A099310 Cf. A003415 (arithmetic derivative of n). %K A099310 nonn %O A099310 1,5 %A A099310 _T. D. Noe_, Oct 12 2004