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 A061468 #15 Aug 22 2020 13:08:06
%S A061468 2,3,4,5,6,6,8,8,9,8,12,10,14,10,12,13,18,12,20,14,16,14,24,16,23,16,
%T A061468 22,18,30,16,32,22,24,20,28,21,38,22,28,24,42,20,44,26,30,26,48,26,45,
%U A061468 26,36,30,54,26,44,32,40,32,60,28,62,34,42,39,52,28
%N A061468 a(n) = d(n) + phi(n), where d(n) is the number of divisors (A000005) and phi(n) is Euler's totient function (A000010).
%C A061468 If d(n) increases phi(n) tends to go down so the sum has a significance.
%H A061468 T. D. Noe, <a href="/A061468/b061468.txt">Table of n, a(n) for n = 1..1000</a>
%e A061468 a(20) = d(20) + phi(20) = 6 + 8 = 14.
%p A061468 with(numtheory); A061468 := n-> tau(n) + phi(n);
%t A061468 Table[DivisorSigma[0,n]+EulerPhi[n],{n,70}] (* _Harvey P. Dale_, Aug 22 2020 *)
%o A061468 (PARI) { for (n=1, 1000, write("b061468.txt", n, " ", numdiv(n) + eulerphi(n)) ) } \\ _Harry J. Smith_, Jul 23 2009
%Y A061468 Cf. A000005, A000010.
%K A061468 nonn,easy
%O A061468 1,1
%A A061468 _Amarnath Murthy_, May 04 2001
%E A061468 More terms from Winston C. Yang (winston(AT)cs.wisc.edu), May 19 2001