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 A378647 #17 Dec 06 2024 11:12:55
%S A378647 1,2,3,4,5,6,7,8,9,10,11,16,13,14,15,16,17,22,19,22,21,22,23,40,25,26,
%T A378647 27,28,29,42,31,32,33,34,35,64,37,38,39,52,41,54,43,44,45,46,47,96,49,
%U A378647 50,51,52,53,70,55,64,57,58,59,126,61,62,63,64,65,78,67,68,69,74,71,176,73,74,75,76,77,90,79,120,81
%N A378647 Dirichlet convolution of A074206 and A103977, where A074206 is the number of ordered factorizations of n, and A103977 is the Zumkeller deficiency of n.
%C A378647 Möbius transform of A378648, which is the Dirichlet convolution of A067824 and A103977.
%H A378647 Antti Karttunen, <a href="/A378647/b378647.txt">Table of n, a(n) for n = 1..20000</a>
%F A378647 a(n) = Sum_{d|n} A074206(d)*A103977(n/d).
%F A378647 a(n) = Sum_{d|n} A008683(d)*A378648(n/d).
%F A378647 a(n) = Sum_{d|n} A067824(d)*A378644(n/d).
%F A378647 a(n) = A378650(n)+n, with a(n) = n if and only if n is a non-abundant number (A263837).
%o A378647 (PARI) A378647(n) = sumdiv(n,d,moebius(d)*A378648(n/d));
%o A378647 (PARI) A378647(n) = sumdiv(n,d,A074206(d)*A103977(n/d));
%Y A378647 Cf. A000027, A008683, A067824, A074206, A103977, A263837, A378648 (inverse Möbius transform), A378649 (Möbius transform), A378650 [= a(n)-n], A378655 (Dirichlet inverse).
%K A378647 nonn
%O A378647 1,2
%A A378647 _Antti Karttunen_, Dec 03 2024