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 A378748 #12 Dec 09 2024 15:16:12 %S A378748 1,0,1,1,2,0,4,5,7,0,5,4,7,2,5,19,8,8,10,6,11,0,13,20,16,2,41,14,14,2, %T A378748 17,65,11,0,19,36,19,2,17,30,20,10,22,12,39,4,25,76,48,12,17,20,28,64, %U A378748 21,58,23,0,29,28,32,4,73,211,31,2,34,18,31,14,35,132,38,2,49,26,43,10,40,114,223,0,43,60,33,2 %N A378748 Möbius transform of A378747. %C A378748 No negative terms. %H A378748 Antti Karttunen, <a href="/A378748/b378748.txt">Table of n, a(n) for n = 1..20000</a> %H A378748 <a href="/index/Pri#prime_indices">Index entries for sequences related to prime indices in the factorization of n</a>. %H A378748 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>. %F A378748 a(n) = Sum_{d|n} A008683(d)*A378747(n/d). %F A378748 a(n) = A378521(n) - A051953(n). %F A378748 For n > 1, a(n) = A000010(n) + A000010(A003961(n))/2 - n. %o A378748 (PARI) %o A378748 A048673(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (factorback(f)+1)/2; }; %o A378748 A378747(n) = (A048673(n)-(sigma(n)-n)); %o A378748 A378748(n) = sumdiv(n,d,moebius(d)*A378747(n/d)); %Y A378748 Cf. A000010, A003961, A003972, A008683, A048673, A051953, A378521, A378747. %Y A378748 Positions of 0's is given by {2} U A108605. %K A378748 nonn %O A378748 1,5 %A A378748 _Antti Karttunen_, Dec 09 2024