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.

A347133 a(n) = Sum_{d|n} A003415(n/d) * A069359(d).

This page as a plain text file.
%I A347133 #11 Aug 27 2021 05:30:36
%S A347133 0,0,0,1,0,2,0,6,1,2,0,16,0,2,2,24,0,19,0,20,2,2,0,72,1,2,9,24,0,40,0,
%T A347133 80,2,2,2,111,0,2,2,96,0,48,0,32,25,2,0,256,1,29,2,36,0,117,2,120,2,2,
%U A347133 0,244,0,2,29,240,2,64,0,44,2,56,0,446,0,2,31,48,2,72,0,352,54,2,0,308,2,2,2,168,0,304,2,56
%N A347133 a(n) = Sum_{d|n} A003415(n/d) * A069359(d).
%C A347133 Dirichlet convolution of A003415 (arithmetic derivative) with A069359.
%C A347133 Dirichlet convolution of A001221 (omega, number of distinct prime factors of n) with A347131.
%H A347133 Antti Karttunen, <a href="/A347133/b347133.txt">Table of n, a(n) for n = 1..10080</a>
%H A347133 Antti Karttunen, <a href="/A347133/a347133.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A347133 a(n) = Sum_{d|n} A003415(n/d) * A069359(d).
%F A347133 a(n) = Sum_{d|n} A001221(n/d) * A347131(d).
%o A347133 (PARI)
%o A347133 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A347133 A069359(n) = (n*sumdiv(n, d, isprime(d)/d)); \\ From A069359
%o A347133 A347133(n) = sumdiv(n,d,A003415(n/d)*A069359(d));
%Y A347133 Cf. A001221, A003415, A069359, A347131.
%Y A347133 Cf. also A300251, A305809, A347132, A347134, A347135.
%K A347133 nonn
%O A347133 1,6
%A A347133 _Antti Karttunen_, Aug 23 2021