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 A095112 #35 Nov 22 2023 11:05:10
%S A095112 0,1,1,3,1,5,1,7,4,7,1,13,1,9,8,15,1,17,1,19,10,13,1,29,6,15,13,25,1,
%T A095112 31,1,31,14,19,12,43,1,21,16,43,1,41,1,37,29,25,1,61,8,37,20,43,1,53,
%U A095112 16,57,22,31,1,77,1,33,37,63,18,61,1,55,26,59,1,95,1,39,43,61,18,71,1,91,40
%N A095112 a(n) is the sum of n/k over all prime powers k > 1 which divide n.
%C A095112 A073093(n)-1 terms are added to produce a(n). - _Michel Marcus_, Aug 29 2013
%H A095112 Antti Karttunen, <a href="/A095112/b095112.txt">Table of n, a(n) for n = 1..65537</a>
%H A095112 Jon Maiga, <a href="http://sequencedb.net/s/A095112">Computer-generated formulas for A095112</a>, Sequence Machine.
%F A095112 a(n) = Sum_{k=1..n} bigomega(gcd(n,k)). - _Lechoslaw Ratajczak_, Jun 18 2017
%F A095112 Sum_{k=1..n} a(k) ~ A154945 * n*(n+1)/2. - _Daniel Suteu_, Apr 01 2019
%F A095112 a(n) = Sum_{d|n} bigomega(d)*phi(n/d). - _Ridouane Oudra_, Oct 30 2023
%F A095112 a(n) = Sum_{d|n} A116512(d). [From Sequence Machine] - _Antti Karttunen_, Nov 22 2023
%e A095112 The prime power divisors of 24 are 2, 4, 8 and 3, so a(24) = 24/2 + 24/4 + 24/8 + 24/3 = 29.
%p A095112 with(numtheory): seq(add(bigomega(d)*phi(n/d),d in divisors(n)), n=1..60); # _Ridouane Oudra_, Oct 30 2023
%t A095112 a[n_]:=Plus@@(n/Flatten[ #[[1]]^Range[ #[[2]]]&/@FactorInteger[n]])
%o A095112 (PARI) A095112(n) = sumdiv(n,d,(1==omega(d))*(n/d)); \\ _Antti Karttunen_, Feb 25 2018
%Y A095112 Cf. A000010, A001221, A001222, A046337 (positions of even terms), A073093, A154945, A366265.
%Y A095112 Inverse Möbius transform of A116512.
%K A095112 nonn
%O A095112 1,4
%A A095112 _Dean Hickerson_, following a suggestion of _Leroy Quet_, May 28 2004