cp's OEIS Frontend

A380090 The sum of the unitary divisors of n that are terms in A207481.

%I A380090 #8 Jan 12 2025 03:52:30
%S A380090 1,3,4,5,6,12,8,1,10,18,12,20,14,24,24,1,18,30,20,30,32,36,24,4,26,42,
%T A380090 28,40,30,72,32,1,48,54,48,50,38,60,56,6,42,96,44,60,60,72,48,4,50,78,
%U A380090 72,70,54,84,72,8,80,90,60,120,62,96,80,1,84,144,68,90,96
%N A380090 The sum of the unitary divisors of n that are terms in A207481.
%C A380090 First differs from A371242 at n = 27.
%H A380090 Amiram Eldar, <a href="/A380090/b380090.txt">Table of n, a(n) for n = 1..10000</a>
%F A380090 a(n) = A034448(A380088(n)).
%F A380090 Multiplicative with a(p^e) = p^e + 1 if e <= p, and 1 otherwise.
%F A380090 a(n) = 1 if and only if n is in A054743.
%F A380090 a(n) < A034448(n) if and only if n is in A185359.
%F A380090 a(n) = A034448(n) if and only if n is in A207481.
%F A380090 a(n) = A377520(n) if and only if n is squarefree (A005117).
%F A380090 Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = Product_{p prime} (p^(p+2) + p^(p+1) + p^p - p - 1)/(p^(p+1) * (p+1)) = 1.2078161... .
%t A380090 f[p_, e_] := If[e <= p, p^e, 0] + 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A380090 (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i,2] <= f[i,1], f[i,1]^f[i,2], 0) + 1);}
%Y A380090 Cf. A005117, A054743, A077610, A185359, A207481, A371242, A377520, A380087, A380088, A380089.
%K A380090 nonn,easy,mult
%O A380090 1,2
%A A380090 _Amiram Eldar_, Jan 12 2025