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.

A378535 Möbius transform of A378542, where A378542 is the sum of divisors d of n such that n/d has an even number of prime factors (counted with multiplicity).

This page as a plain text file.
%I A378535 #7 Dec 01 2024 19:54:25
%S A378535 1,1,2,3,4,3,6,5,7,5,10,7,12,7,9,11,16,9,18,13,13,11,22,13,21,13,20,
%T A378535 19,28,15,30,21,21,17,25,23,36,19,25,23,40,21,42,31,30,23,46,27,43,25,
%U A378535 33,37,52,27,41,33,37,29,58,33,60,31,44,43,49,33,66,49,45,35,70,41,72,37,46,55,61,39,78,49,61,41,82
%N A378535 Möbius transform of A378542, where A378542 is the sum of divisors d of n such that n/d has an even number of prime factors (counted with multiplicity).
%H A378535 Antti Karttunen, <a href="/A378535/b378535.txt">Table of n, a(n) for n = 1..20000</a>
%F A378535 a(n) = Sum_{d|n} A008683(d)*A378542(n/d).
%o A378535 (PARI)
%o A378535 A378542(n) = sumdiv(n,d,d*!(bigomega(n/d)%2));
%o A378535 A378535(n) = sumdiv(n,d,moebius(d)*A378542(n/d));
%Y A378535 Cf. A001222, A008683, A378535, A378536 (Dirichlet inverse).
%K A378535 nonn
%O A378535 1,3
%A A378535 _Antti Karttunen_, Dec 01 2024