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.

A354349 Dirichlet inverse of A181819, prime shadow of n.

This page as a plain text file.
%I A354349 #11 Jun 05 2022 23:20:05
%S A354349 1,-2,-2,1,-2,4,-2,-1,1,4,-2,-2,-2,4,4,2,-2,-2,-2,-2,4,4,-2,2,1,4,-1,
%T A354349 -2,-2,-8,-2,-3,4,4,4,1,-2,4,4,2,-2,-8,-2,-2,-2,4,-2,-4,1,-2,4,-2,-2,
%U A354349 2,4,2,4,4,-2,4,-2,4,-2,7,4,-8,-2,-2,4,-8,-2,-1,-2,4,-2,-2,4,-8,-2,-4,2,4,-2,4,4,4,4,2,-2,4,4
%N A354349 Dirichlet inverse of A181819, prime shadow of n.
%C A354349 Multiplicative because A181819 is.
%H A354349 Antti Karttunen, <a href="/A354349/b354349.txt">Table of n, a(n) for n = 1..65537</a>
%F A354349 a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, d < n} A181819(n/d) * a(d).
%o A354349 (PARI)
%o A354349 A181819(n) = factorback(apply(e->prime(e),(factor(n)[,2])));
%o A354349 memoA354349 = Map();
%o A354349 A354349(n) = if(1==n,1,my(v); if(mapisdefined(memoA354349,n,&v), v, v = -sumdiv(n,d,if(d<n,A181819(n/d)*A354349(d),0)); mapput(memoA354349,n,v); (v)));
%Y A354349 Cf. A181819.
%Y A354349 Cf. also A354186, A354351, A354359.
%K A354349 sign,mult
%O A354349 1,2
%A A354349 _Antti Karttunen_, Jun 05 2022