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 A062949 #17 Aug 31 2023 03:48:25
%S A062949 1,3,5,9,9,15,13,25,23,27,21,45,25,39,45,65,33,69,37,81,65,63,45,125,
%T A062949 69,75,95,117,57,135,61,161,105,99,117,207,73,111,125,225,81,195,85,
%U A062949 189,207,135,93,325,139,207,165,225,105,285,189,325,185,171,117,405
%N A062949 Multiplicative with a(p^e) = ((e+1)*p^(e+1)-(e+2)*p^e+1)/(p-1).
%C A062949 Inverse Mobius transform of A062355.
%H A062949 Amiram Eldar, <a href="/A062949/b062949.txt">Table of n, a(n) for n = 1..10000</a>
%F A062949 a(n) = Sum_{d|n} phi(d)*tau(d).
%F A062949 a(n) = Sum_{k=1..n} tau(n/gcd(n, k)).
%F A062949 a(n) = Sum_{d|n} d*uphi(n/d), where uphi() = A047994(). - _Vladeta Jovovic_, Mar 16 2004
%p A062949 A062949 := proc(n) add(numtheory[phi](d)*numtheory[tau](d), d=numtheory[divisors](n)) ; end proc: # _R. J. Mathar_, Feb 09 2011
%t A062949 f[p_, e_] := ((e+1)*p^(e+1)-(e+2)*p^e+1)/(p-1); a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 60] (* _Amiram Eldar_, Jul 31 2019 *)
%Y A062949 Cf. A057660, A029939.
%K A062949 nonn,easy,mult
%O A062949 1,2
%A A062949 _Vladeta Jovovic_, Jul 21 2001