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 A349389 #12 Nov 26 2021 09:44:32
%S A349389 2,0,0,1,0,4,0,5,4,4,0,10,0,8,8,19,0,16,0,10,16,4,0,26,4,8,32,20,0,0,
%T A349389 0,65,8,4,16,42,0,8,16,26,0,0,0,10,32,12,0,70,16,24,8,20,0,68,8,52,16,
%U A349389 4,0,4,0,12,64,211,16,0,0,10,24,0,0,114,0,8,48,20,16,0,0,70,196,4,0,8,8,8,8,26,0,8,32,30
%N A349389 a(n) = A349387(n) + A349388(n).
%H A349389 Antti Karttunen, <a href="/A349389/b349389.txt">Table of n, a(n) for n = 1..20000</a>
%H A349389 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A349389 a(1) = 2, and for n >1, a(n) = -Sum_{d|n, 1<d<n} A349387(d) * A349388(n/d). [As the sequences are Dirichlet inverses of each other]
%t A349389 f1[p_,e_] := (q = NextPrime[p])^e - p * q^(e-1); f2[p_, e_] := p^e - NextPrime[p] * p^(e-1); a[1] = 2; a[n_] := Times @@ f1 @@@ (f = FactorInteger[n]) + Times @@ f2 @@@ f; Array[a, 100] (* _Amiram Eldar_, Nov 18 2021 *)
%o A349389 (PARI) A349389(n) = (A349387(n) + A349388(n)); \\ Needs also code from A349387 and A349388.
%Y A349389 Cf. A349387, A349388.
%Y A349389 Cf. also A349383.
%K A349389 nonn
%O A349389 1,1
%A A349389 _Antti Karttunen_, Nov 17 2021