cp's OEIS Frontend

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.

A378754 Dirichlet convolution of -A252748 and A323910.

This page as a plain text file.
%I A378754 #7 Dec 11 2024 20:17:59
%S A378754 1,0,-1,-2,-1,-2,-3,-10,-10,-2,-1,-10,-3,-6,-5,-38,-1,-22,-3,-10,-11,
%T A378754 -2,-5,-42,-14,-6,-60,-22,-1,-14,-5,-130,-5,-2,-11,-76,-3,-6,-11,-42,
%U A378754 -1,-30,-3,-10,-36,-10,-5,-158,-46,-30,-5,-22,-5,-144,-5,-78,-11,-2,-1,-58,-5,-10,-64,-422,-11,-14,-3,-10,-17,-30
%N A378754 Dirichlet convolution of -A252748 and A323910.
%H A378754 Antti Karttunen, <a href="/A378754/b378754.txt">Table of n, a(n) for n = 1..20000</a>
%H A378754 <a href="/index/Pri#prime_indices">Index entries for sequences related to prime indices in the factorization of n</a>.
%H A378754 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>.
%F A378754 a(n) = Sum_{d|n} -A252748(d)*A323910(n/d).
%o A378754 (PARI)
%o A378754 A033879(n) = (n+n-sigma(n));
%o A378754 memoA323910 = Map();
%o A378754 A323910(n) = if(1==n,1,my(v); if(mapisdefined(memoA323910,n,&v), v, v = -sumdiv(n,d,if(d<n,A033879(n/d)*A323910(d),0)); mapput(memoA323910,n,v); (v)));
%o A378754 A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A378754 A252748(n) = (A003961(n) - (2*n));
%o A378754 A378754(n) = sumdiv(n,d,-A252748(d)*A323910(n/d));
%Y A378754 Cf. A033879, A252748, A323910, A378755 (Dirichlet inverse).
%K A378754 sign
%O A378754 1,4
%A A378754 _Antti Karttunen_, Dec 11 2024