login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280292 a(n) = sopfr(n) - sopf(n). 5

%I #22 Nov 02 2020 20:39:09

%S 0,0,0,2,0,0,0,4,3,0,0,2,0,0,0,6,0,3,0,2,0,0,0,4,5,0,6,2,0,0,0,8,0,0,

%T 0,5,0,0,0,4,0,0,0,2,3,0,0,6,7,5,0,2,0,6,0,4,0,0,0,2,0,0,3,10,0,0,0,2,

%U 0,0,0,7,0,0,5,2,0,0,0,6,9,0,0,2,0,0,0,4,0,3,0,2,0,0,0,8,0,7,3,7,0,0,0,4,0

%N a(n) = sopfr(n) - sopf(n).

%C Alladi and Erdős (1977) proved that for all numbers m>=0, m!=1, the sequence of numbers k such that a(k) = m has a positive asymptotic density which is equal to a rational multiple of 1/zeta(2) = 6/Pi^2 (A059956). For example, when m=0, the sequence is the squarefree numbers (A005117), whose density is 6/Pi^2, and when m=2 the sequence is A081770, whose density is 1/Pi^2. - _Amiram Eldar_, Nov 02 2020

%D Jean-Marie De Koninck and Aleksandar Ivić, Topics in Arithmetical Functions: Asymptotic Formulae for Sums of Reciprocals of Arithmetical Functions and Related Fields, Amsterdam, Netherlands: North-Holland, 1980. See pp. 164-166.

%D Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 165.

%H Antti Karttunen, <a href="/A280292/b280292.txt">Table of n, a(n) for n = 1..20000</a>

%H Krishnaswami Alladi and Paul Erdős, <a href="https://projecteuclid.org/euclid.pjm/1102811427">On an additive arithmetic function</a>, Pacific Journal of Mathematics, Vol. 71, No. 2 (1977), pp. 275-294, <a href="https://msp.org/pjm/1977/71-2/pjm-v71-n2-p01-s.pdf">alternative link</a>.

%H Jean-Marie De Koninck, Paul Erdős and Aleksandar Ivić, <a href="https://doi.org/10.4153/CMB-1981-035-7">Reciprocals of certain large additive functions</a>, Canadian Mathematical Bulletin, Vol. 24, No. 2 (1981), pp. 225-231.

%H Aleksandar Ivić, <a href="https://arxiv.org/abs/math/0311505">On certain large additive functions</a>, arXiv:math/0311505 [math.NT], 2003.

%F a(n) = A001414(n) - A008472(n).

%F a(A005117(n)) = 0.

%F a(n) = A001414(A003557(n)). - _Antti Karttunen_, Oct 07 2017

%F Additive with a(1) = 0 and a(p^e) = p*(e-1) for prime p and e > 0. - _Werner Schulte_, Feb 24 2019

%F From _Amiram Eldar_, Nov 02 2020: (Start)

%F a(n) = a(A057521(n)).

%F Sum_{n<=x} a(n) ~ x*log(log(x)) + O(x) (Alladi and Erdős, 1977).

%F Sum_{n<=x, n nonsquarefree} 1/a(n) ~ c*x + O(sqrt(x)*log(x)), where c = Integral_{t=0..1} (F(t)-6/Pi^2)/t dt, and F(t) = Product_{p prime} (1-1/p)*(1-1/(t^p - p)) (De Koninck et al., 1981; Finch, 2018), or, equivalently c = Sum_{k>=2} d(k)/k = 0.1039..., where d(k) = (6/Pi^2)*A338559(k)/A338560(k) is the asymptotic density of the numbers m with a(m) = k (Alladi and Erdős, 1977; Ivić, 2003). (End)

%t Array[Total@ # - Total@ Union@ # &@ Flatten[ConstantArray[#1, #2] & @@@ FactorInteger@ #] &, 105] (* _Michael De Vlieger_, Feb 25 2019 *)

%o (PARI) sopfr(n) = my(f=factor(n)); sum(j=1, #f~, f[j, 1]*f[j, 2]);

%o sopf(n) = my(f=factor(n)); sum(j=1, #f~, f[j, 1]);

%o a(n) = sopfr(n) - sopf(n);

%Y Cf. A001414 (sopfr), A008472 (sopf).

%Y Cf. A003557, A005117, A013929.

%Y Cf. A280163, A280286.

%Y Cf. A013929, A057521, A059956, A081770, A338559, A338560.

%K nonn

%O 1,4

%A _Michel Marcus_, Dec 31 2016

%E More terms from _Antti Karttunen_, Oct 07 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)