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.

A378648 Dirichlet convolution of A067824 and A103977, where A067824 is the number of strict chains of divisors starting with n, and A103977 is the Zumkeller deficiency of n.

This page as a plain text file.
%I A378648 #11 Dec 06 2024 11:13:01
%S A378648 1,3,4,7,6,12,8,15,13,18,12,32,14,24,24,31,18,43,20,44,32,36,24,80,31,
%T A378648 42,40,56,30,84,32,63,48,54,48,127,38,60,56,104,42,108,44,84,78,72,48,
%U A378648 192,57,93,72,98,54,140,72,128,80,90,60,252,62,96,104,127,84,156,68,126,96,148,72,351,74,114,124,140,96
%N A378648 Dirichlet convolution of A067824 and A103977, where A067824 is the number of strict chains of divisors starting with n, and A103977 is the Zumkeller deficiency of n.
%C A378648 Inverse Möbius transform of A378647.
%H A378648 Antti Karttunen, <a href="/A378648/b378648.txt">Table of n, a(n) for n = 1..20000</a>
%F A378648 a(n) = Sum_{d|n} A067824(d)*A103977(n/d).
%F A378648 a(n) = Sum_{d|n} A378647(d).
%F A378648 a(n) = A000203(n) + A378653(n), with a(n) = sigma(n) if and only if n is a non-abundant number (A263837).
%o A378648 (PARI)
%o A378648 A074206(n) = if(n>1, sumdiv(n, i, if(i<n, A074206(i))), n);
%o A378648 A067824(n) = if(1==n,n,2*A074206(n));
%o A378648 A378648(n) = sumdiv(n,d,A067824(d)*A103977(n/d))
%Y A378648 Cf. A000203, A005101, A067824, A103977, A263837, A378647 (Möbius transform), A378649, A378653 [= a(n)-sigma(n)].
%K A378648 nonn
%O A378648 1,2
%A A378648 _Antti Karttunen_, Dec 03 2024