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 A140668 #9 Feb 14 2019 07:46:23
%S A140668 2,0,0,4,0,7,0,8,9,11,0,12,0,15,16,16,0,18,0,20,22,23,0,24,25,27,27,
%T A140668 28,0,29,0,32,34,35,36,36,0,39,40,40,0,41,0,44,45,47,0,48,49,50,52,52,
%U A140668 0,54,56,56,58,59,0,60,0,63,63,64,66,65,0,68,70,69,0,72,0,75,75,76,78,77,0,80,81,83,0,84,86,87,88,88,0
%N A140668 a(n) = n + A140664(n).
%C A140668 For n>1, a(n) = n iff mu(n) = 0; 0 if n is prime; and (n+1) iff mu(n) = 1.
%H A140668 Antti Karttunen, <a href="/A140668/b140668.txt">Table of n, a(n) for n = 1..20000</a>
%F A140668 a(n) = n + A140664(n), where A140664 = (1, -2, -3, 0, -5, 1, -7, 0, 0, 1,...)
%e A140668 a(4) = 4 = 4 + A140664(4) = 4 + 0.
%t A140668 Table[Exp[MangoldtLambda[n]]*MoebiusMu[n] + n, {n, 100}] (* _G. C. Greubel_, Feb 13 2019 *)
%o A140668 (PARI)
%o A140668 A014963(n) = ispower(n, , &n); if(isprime(n), n, 1); \\ From A014963
%o A140668 A140664(n) = (moebius(n)*A014963(n));
%o A140668 A140668(n) = (n+A140664(n)); \\ _Antti Karttunen_, Feb 13 2019
%o A140668 (Sage)
%o A140668 def A140668(n): return simplify(exp(add(moebius(d)*log(n/d) for d in divisors(n))))*moebius(n) + n
%o A140668 [A140668(n) for n in (1..100)] # _G. C. Greubel_, Feb 13 2019
%Y A140668 Cf. A140664, A008683.
%K A140668 nonn
%O A140668 1,1
%A A140668 _Gary W. Adamson_ and _Mats Granvik_, May 20 2008
%E A140668 More terms from _Antti Karttunen_, Feb 13 2019