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 A322979 #10 Jan 07 2019 11:11:20
%S A322979 1,3,2,4,2,6,2,8,5,6,2,13,2,6,4,9,2,15,2,9,4,6,2,25,3,6,6,9,2,12,2,11,
%T A322979 4,6,4,31,2,6,4,21,2,12,2,9,10,6,2,28,3,9,4,9,2,18,4,21,4,6,2,33,2,6,
%U A322979 10,12,4,12,2,9,4,12,2,55,2,6,8,9,4,12,2,32,7,6,2,33,4,6,4,21,2,30,4,9,4,6,4,42,2,9,10,13,2,12,2,21,8
%N A322979 a(n) = Sum A009191(d) over the divisors d of n, where A009191(x) = gcd(x, A000005(x)), and A000005(x) gives the number of divisors of x.
%C A322979 Inverse Möbius transform of A009191.
%H A322979 Antti Karttunen, <a href="/A322979/b322979.txt">Table of n, a(n) for n = 1..10080</a>
%H A322979 Antti Karttunen, <a href="/A322979/a322979.txt">Data supplement: n, a(n) computed for n = 1..100000</a>
%F A322979 a(n) = Sum_{d|n} A009191(d).
%o A322979 (PARI)
%o A322979 A009191(n) = gcd(n, numdiv(n));
%o A322979 A322979(n) = sumdiv(n,d,A009191(d));
%Y A322979 Cf. A009191.
%K A322979 nonn
%O A322979 1,2
%A A322979 _Antti Karttunen_, Jan 05 2019