A173290 -id:A173290 - cp's OEIS frontend

A309272 Numbers m such that m divides A173290(m) = Sum_{k=1..m} psi(k), where psi is the Dedekind psi function (A001615).

1, 2, 5, 15, 31, 40, 66, 81, 315, 966, 1398, 1768, 30166, 32335, 98734, 388033, 591597, 1375056, 14966304, 15160528, 50793208, 51302236, 99253376, 110994356, 230465053, 402340268, 497982399, 2027319577, 2879855394, 18450762682, 29922126368, 31711273834, 40583934786

Offset: 1

Amiram Eldar, Oct 23 2019

nonn

The corresponding quotients are 1, 2, 4, 12, 24, 31, 51, 62, 240, 735, 1063, 1344, 22924, 24572, 75029, 294870, 449560, 1044918, 11373028, 11520620, 38598210, 38985025, 75423522, 84345597, 175132440, 305741942, 378421246, 1540578144, 2188427680, 14020898356, 22738089456, 24097678498, 30840092321, ...

			2 is in the sequence since psi(1) + psi(2) = 1 + 3 = 4 is divisible by 2.
5 is in the sequence since psi(1) + psi(2) + ... + psi(5) = 1 + 3 + 4 + 6 + 6 = 20 is divisible by 5.

Cf. A001615, A173290.

Cf. A045345, A048290, A050226, A056550, A063971, A064605, A064606, A064607, A064610, A064611, A064612, A306950, A307043, A307161, A326488.

psi[1] = 1; psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); seq = {}; s = 0; Do[s += psi[n]; If[Divisible[s, n], AppendTo[seq, n]], {n, 1, 10^4}]; seq

a(31)-a(33) from Giovanni Resta, Oct 24 2019

A001615 Dedekind psi function: n * Product_{p|n, p prime} (1 + 1/p).

Original entry on oeis.org

1, 3, 4, 6, 6, 12, 8, 12, 12, 18, 12, 24, 14, 24, 24, 24, 18, 36, 20, 36, 32, 36, 24, 48, 30, 42, 36, 48, 30, 72, 32, 48, 48, 54, 48, 72, 38, 60, 56, 72, 42, 96, 44, 72, 72, 72, 48, 96, 56, 90, 72, 84, 54, 108, 72, 96, 80, 90, 60, 144, 62, 96, 96, 96, 84, 144, 68, 108, 96

Offset: 1

N. J. A. Sloane

Number of primitive sublattices of index n in generic 2-dimensional lattice; also index of Gamma_0(n) in SL_2(Z).
A generic 2-dimensional lattice L =  consists of all vectors of the form mV + nW, (m,n integers). A sublattice S =  has index |ad-bc| and is primitive if gcd(a,b,c,d) = 1. The generic lattice L has precisely a(2) = 3 sublattices of index 2, namely <2V,W>,  and  (which = ) and so on for other indices.
The sublattices of index n are in 1-to-1 correspondence with matrices [a b; 0 d] with a>0, ad=n, b in [0..d-1]. The number of these is Sum_{d|n} = sigma(n), which is A000203. A sublattice is primitive if gcd(a,b,d) = 1; the number of these is n * product_{p|n} (1+1/p), which is the present sequence.
SL_2(Z) = Gamma is the group of all 2 X 2 matrices [a b; c d] where a,b,c,d are integers with ad-bc = 1 and Gamma_0(N) is usually defined as the subgroup of this for which N|c. But conceptually Gamma is best thought of as the group of (positive) automorphisms of a lattice , its typical element taking V -> aV + bW, W -> cV + dW and then Gamma_0(N) can be defined as the subgroup consisting of the automorphisms that fix the sublattice  of index N. - J. H. Conway, May 05 2001
Dedekind proved that if n = k_i*j_i for i in I represents all the ways to write n as a product, and e_i=gcd(k_i,j_i), then a(n)= sum(k_i / (e_i * phi(e_i)), i in I ) [cf. Dickson, History of the Theory of Numbers, Vol. 1, p. 123].
Also a(n)= number of cyclic subgroups of order n in an Abelian group of order n^2 and type (1,1) (Fricke). - Len Smiley, Dec 04 2001
The polynomial degree of the classical modular equation of degree n relating j(z) and j(nz) is psi(n) (Fricke). - Michael Somos, Nov 10 2006; clarified by Katherine E. Stange, Mar 11 2022
The Mobius transform of this sequence is A063659. - Gary W. Adamson, May 23 2008
The inverse Mobius transform of this sequence is A060648. - Vladeta Jovovic, Apr 05 2009
The Dirichlet inverse of this sequence is A008836(n) * A048250(n). - Álvar Ibeas, Mar 18 2015
The Riemann Hypothesis is true if and only if a(n)/n - e^gamma*log(log(n)) < 0 for any n > 30. - Enrique Pérez Herrero, Jul 12 2011
The Riemann Hypothesis is also equivalent to another inequality, see the Sole and Planat link. - Thomas Ordowski, May 28 2017
An infinitary analog of this sequence is the sum of the infinitary divisors of n (see A049417). - Vladimir Shevelev, Apr 01 2014
Problem: are there composite numbers n such that n+1 divides psi(n)? - Thomas Ordowski, May 21 2017
The sum of divisors d of n such that n/d is squarefree. - Amiram Eldar, Jan 11 2019
Psi(n)/n is a new maximum for each primorial (A002110) [proof in link: Patrick Sole and Michel Planat, Proposition 1 page 2]. - Bernard Schott, May 21 2020
From Jianing Song, Nov 05 2022: (Start)
a(n) is the number of subgroups of C_n X C_n that are isomorphic to C_n, where C_n is the cyclic group of order n. Proof: the number of elements of order n in C_n X C_n is A007434(n) (they are the elements of the form (a,b) in C_n X C_n where gcd(a,b,n) = 1), and each subgroup isomorphic to C_n contains phi(n) generators, so the number of such subgroups is A007434(n)/phi(n) = a(n).
The total number of order-n subgroups of C_n X C_n is A000203(n). (End)

			Let L = <V,W> be a 2-dimensional lattice. The 6 primitive sublattices of index 4 are generated by <4V,W>, <V,4W>, <4V,W+-V>, <2V+W,2W>, <2V,2W+V>. Compare A000203.
G.f. = x + 3*x^2 + 4*x^3 + 6*x^4 + 6*x^5 + 12*x^6 + 8*x^7 + 12*x^8 + 12*x^9 + ...

Tom Apostol, Intro. to Analyt. Number Theory, page 71, Problem 11, where this is called phi_1(n).
David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989, p. 228.
R. Fricke, Die elliptischen Funktionen und ihre Anwendungen, Teubner, 1922, Vol. 2, see p. 220.
Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004. See Section B41, p. 147.
B. Schoeneberg, Elliptic Modular Functions, Springer-Verlag, NY, 1974, p. 79.
G. Shimura, Introduction to the Arithmetic Theory of Automorphic Functions, Princeton, 1971, see p. 25, Eq. (1).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe and N. J. A. Sloane, Table of n, a(n) for n = 1..10000
O. Bordelles and B. Cloitre, An Alternating Sum Involving the Reciprocal of Certain Multiplicative Functions, J. Int. Seq. 16 (2013) #13.6.3.
Harriet Fell, Morris Newman, and Edward Ordman, Tables of genera of groups of linear fractional transformations, J. Res. Nat. Bur. Standards Sect. B 67B 1963 61-68.
M. Hampejs, N. Holighaus, L. Toth and C. Wiesmeyr, Representing and counting the subgroups of the group Z_m X Z_n, arXiv:1211.1797 [math.GR], 2012.
W. Hürlimann, Dedekind's arithmetic function and primitive four squares counting functions, Journal of Algebra, Number Theory: Advances and Applications 14:2 (2015), 73-88.
F. A. Lewis et al., Problem 4002, Amer. Math. Monthly, Vol. 49, No. 9, Nov. 1942, pp. 618-619.
E. Pérez Herrero, Recycling Hardy & Wright, Average Order of Dedekind Psi Function, Psychedelic Geometry Blogspot.
Michel Planat, Riemann hypothesis from the Dedekind psi function, arXiv:1010.3239 [math.GM], 2010.
Patrick Sole and Michel Planat, Extreme values of the Dedekind Psi function, to appear in Journal of Combinatorics and Number Theory, arXiv:1011.1825 [math.NT], 2010-2011.
Eric Weisstein's World of Mathematics, Dedekind Function
Wikipedia, Dedekind psi function
Index entries for "core" sequences
Index entries for sequences related to sublattices

Other sequences that count lattices/sublattices: A000203 (with primitive condition removed), A003050 (hexagonal lattice instead), A003051, A054345, A160889, A160891.
Cf. A002110, A027748, A124010, A019269.
Cf. A301594.
Cf. A063659 (Möbius transform), A082020 (average order), A156303 (Euler transform), A173290 (partial sums), A175836 (partial products), A203444 (range).
Cf. A210523 (record values).
Algebraic combinations with other core sequences: A000082, A033196, A175732, A291784, A344695.
Sequences of the form n^k * Product_ {p|n, p prime} (1 + 1/p^k) for k=0..10: A034444 (k=0), this sequence (k=1), A065958 (k=2), A065959 (k=3), A065960 (k=4), A351300 (k=5), A351301 (k=6), A351302 (k=7), A351303 (k=8), A351304 (k=9), A351305 (k=10).
Cf. A082695 (Dgf at s=3), A339925 (Dgf at s=4).

import Data.Ratio (numerator)
a001615 n = numerator (fromIntegral n * (product $
            map ((+ 1) . recip . fromIntegral) $ a027748_row n))
-- Reinhard Zumkeller, Jun 03 2013, Apr 12 2012

m:=75; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&+[MoebiusMu(k)^2*x^k/(1-x^k)^2: k in [1..2*m]]) )); // G. C. Greubel, Nov 23 2018

A001615 := proc(n) n*mul((1+1/i[1]),i=ifactors(n)[2]) end; # Mark van Hoeij, Apr 18 2012

Join[{1}, Table[n Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]), {n, 2, 100}]] (* T. D. Noe, Jun 11 2006 *)
Table[DirichletConvolve[j, MoebiusMu[j]^2, j, n], {n, 100}] (* Jan Mangaldan, Aug 22 2013 *)
a[n_] := n Sum[MoebiusMu[d]^2/d, {d, Divisors[n]}]; (* Michael Somos, Jan 10 2015 *)
Table[n Product[1 + 1/p, {p, Select[Divisors[n], PrimeQ]}], {n, 1, 100}] (* Vaclav Kotesovec, May 08 2021 *)
Table[n DivisorSum[n, MoebiusMu[#]^2/# &], {n, 20}] (* Eric W. Weisstein, Mar 09 2025 *)

{a(n) = if( n<1, 0, direuler( p=2, n, (1 + X) / (1 - p*X)) [n])};

{a(n) = if( n<1, 0, n * sumdiv( n, d, moebius(d)^2 / d))}; /* Michael Somos, Nov 10 2006 */

a(n)=my(f=factor(n)); prod(i=1,#f~, f[i,1]^f[i,2] + f[i,1]^(f[i,2]-1)) \\ Charles R Greathouse IV, Aug 22 2013

a(n) = n * sumdivmult(n, d, issquarefree(d)/d) \\ Charles R Greathouse IV, Sep 09 2014

from math import prod
from sympy import primefactors
def A001615(n):
    plist = primefactors(n)
    return n*prod(p+1 for p in plist)//prod(plist) # Chai Wah Wu, Jun 03 2021

def A001615(n) : return n*mul(1+1/p for p in prime_divisors(n))
[A001615(n) for n in (1..69)] # Peter Luschny, Jun 10 2012

Dirichlet g.f.: zeta(s) * zeta(s-1) / zeta(2*s). - Michael Somos, May 19 2000
Multiplicative with a(p^e) = (p+1)*p^(e-1). - David W. Wilson, Aug 01 2001
a(n) = A003557(n)*A048250(n) = n*A000203(A007947(n))/A007947(n). - Labos Elemer, Dec 04 2001
a(n) = n*Sum_{d|n} mu(d)^2/d, Dirichlet convolution of A008966 and A000027. - Benoit Cloitre, Apr 07 2002
a(n) = Sum_{d|n} mu(n/d)^2 * d. - Joerg Arndt, Jul 06 2011
From Enrique Pérez Herrero, Aug 22 2010: (Start)
a(n) = J_2(n)/J_1(n) = J_2(n)/phi(n) = A007434(n)/A000010(n), where J_k is the k-th Jordan Totient Function.
a(n) = (1/phi(n))*Sum_{d|n} mu(n/d)*d^(b-1), for b=3. (End)
a(n) = n / Sum_{d|n} mu(d)/a(d). - Enrique Pérez Herrero, Jun 06 2012
a(n^k)= n^(k-1) * a(n). - Enrique Pérez Herrero, Jan 05 2013
If n is squarefree, then a(n) = A049417(n) = A000203(n). - Vladimir Shevelev, Apr 01 2014
a(n) = Sum_{d^2 | n} mu(d) * A000203(n/d^2). - Álvar Ibeas, Dec 20 2014
The average order of a(n) is 15*n/Pi^2. - Enrique Pérez Herrero, Jan 14 2012. See Apostol. - N. J. A. Sloane, Sep 04 2017
G.f.: Sum_{k>=1} mu(k)^2*x^k/(1 - x^k)^2. - Ilya Gutkovskiy, Oct 25 2018
a(n) = Sum_{d|n} 2^omega(d) * phi(n/d), Dirichlet convolution of A034444 and A000010. - Daniel Suteu, Mar 09 2019
From Richard L. Ollerton, May 07 2021: (Start)
a(n) = Sum_{k=1..n} 2^omega(gcd(n,k)).
a(n) = Sum_{k=1..n} 2^omega(n/gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). (End)
a(n) = abs(A158523(n)) = A158523(n) * A008836(n). - Enrique Pérez Herrero, Nov 07 2022
a(n) = (1/n) * Sum_{d|n} mu(n/d)*sigma(d^2). - Ridouane Oudra, Mar 26 2025

More terms from Olivier Gérard, Aug 15 1997

A357817 Partial alternating sums of the Dedekind psi function (A001615): a(n) = Sum_{k=1..n} (-1)^(k+1) * psi(k).

Original entry on oeis.org

1, -2, 2, -4, 2, -10, -2, -14, -2, -20, -8, -32, -18, -42, -18, -42, -24, -60, -40, -76, -44, -80, -56, -104, -74, -116, -80, -128, -98, -170, -138, -186, -138, -192, -144, -216, -178, -238, -182, -254, -212, -308, -264, -336, -264, -336, -288, -384, -328, -418

Offset: 1

Amiram Eldar, Oct 14 2022

sign

Amiram Eldar, Table of n, a(n) for n = 1..10000
László Tóth, Alternating Sums Concerning Multiplicative Arithmetic Functions, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.1.

Cf. A001615, A173290.

Similar sequences: A068762, A068773, A307704.

psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); psi[1] = 1; Accumulate[Array[(-1)^(# + 1)*psi[#] &, 50]]

f(n) = n * sumdivmult(n, d, issquarefree(d)/d); \\ A001615
a(n) = sum(k=1, n, (-1)^(k+1) * f(k)); \\ Michel Marcus, Oct 15 2022

a(n) = -(3/(2*Pi^3)) * n^2 + O(n * log(n)^(2/3)) (Tóth, 2017).

A357820 Numerators of the partial alternating sums of the reciprocals of the Dedekind psi function (A001615).

Original entry on oeis.org

1, 2, 11, 3, 11, 5, 23, 7, 23, 65, 71, 17, 64, 491, 64, 491, 173, 505, 2651, 2581, 10639, 1151, 3593, 3523, 727, 237, 2189, 2147, 11071, 10931, 5623, 2759, 5623, 16589, 2113, 8347, 162373, 159979, 20318, 160549, 163969, 649891, 7292441, 7204661, 7292441, 7204661

Offset: 1

Amiram Eldar, Oct 14 2022

			Fractions begin with 1, 2/3, 11/12, 3/4, 11/12, 5/6, 23/24, 7/8, 23/24, 65/72, 71/72, 17/18, ...

Olivier Bordellès and Benoit Cloitre, An alternating sum involving the reciprocal of certain multiplicative functions, Journal of Integer Sequences, Vol. 16 (2013), Article 13.6.3.
László Tóth, Alternating Sums Concerning Multiplicative Arithmetic Functions, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.1.

Cf. A001615, A173290, A357821 (denominators).
Cf. A001620, A065463, A335707.
Similar sequence: A211177.

psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); psi[1] = 1; Numerator[Accumulate[1/Array[(-1)^(# + 1)*psi[#] &, 50]]]

f(n) = n * sumdivmult(n, d, issquarefree(d)/d); \\ A001615
a(n) = numerator(sum(k=1, n, (-1)^(k+1)/f(k))); \\ Michel Marcus, Oct 15 2022

a(n) = numerator(Sum_{k=1..n} (-1)^(k+1)/psi(k)).

a(n)/A357821(n) ~ (C/5) * (log(n) + gamma + D + 24*log(2)/5) + O(log(n)^(2/3) * log(log(n))^(4/3) / n), where C = Product_{p prime} (1 - 1/(p*(p+1))) (A065463), and D = Sum_{p prime} log(p)/(p^2+p-1) (A335707) (Bordellès and Cloitre, 2013; Tóth, 2017).

A357821 Denominators of the partial alternating sums of the reciprocals of the Dedekind psi function (A001615).

Original entry on oeis.org

1, 3, 12, 4, 12, 6, 24, 8, 24, 72, 72, 18, 63, 504, 63, 504, 168, 504, 2520, 2520, 10080, 1120, 3360, 3360, 672, 224, 2016, 2016, 10080, 10080, 5040, 2520, 5040, 15120, 1890, 7560, 143640, 143640, 17955, 143640, 143640, 574560, 6320160, 6320160, 6320160, 6320160

Offset: 1

Amiram Eldar, Oct 14 2022

See A357820 for more details.

Cf. A001615, A173290, A357820 (numerators).

Similar sequence: A211178.

psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); psi[1] = 1; Denominator[Accumulate[1/Array[(-1)^(# + 1)*psi[#] &, 50]]]

f(n) = n * sumdivmult(n, d, issquarefree(d)/d); \\ A001615
a(n) = denominator(sum(k=1, n, (-1)^(k+1)/f(k))); \\ Michel Marcus, Oct 15 2022

a(n) = denominator(Sum_{k=1..n} (-1)^(k+1)/psi(k)).

A327340 Numerator of the rationals r(n) = (1/n^2)*Phi_1(n), with Phi_1(n) = Sum{k=1..n} psi(k), with Dedekind's psi function.

Original entry on oeis.org

1, 1, 8, 7, 4, 8, 40, 13, 64, 41, 94, 59, 132, 39, 4, 51, 222, 43, 278, 157, 346, 191, 406, 227, 484, 263, 562, 305, 640, 178, 24, 99, 280, 447, 942, 169, 1052, 278, 1168, 31, 1282, 689, 1422, 747, 58, 819, 1686, 99, 1838, 482

Offset: 1

Wolfdieter Lang, Sep 03 2019

The corresponding denominators are given in A327341.
Dedekind's psi(k) = k*Product_{p|k}(1 + 1/p), with primes p, and the empty product is set to 1. See psi(k) = A001615(k), k >= 1. In the Walfisz reference psi(k) = phi_1(k).
In the  Walfisz reference, Satz 2., p. 100, the approximation for Phi_1(x) = (15/(2*Pi^2))*x^2 + O(x*(log(x))^{2/3}) is given (with B instead of the O() notation). For the constant 15/(2*Pi^2) see A323669 .

			The rationals (in lowest terms) begin: 1/1, 1/1, 8/9, 7/8, 4/5, 8/9, 40/49, 13/16, 64/81, 41/50, 94/121, 59/72, 132/169, 39/49, 4/5, 51/64, 222/289, 43/54, 278/361, 157/200, 346/441, 191/242, 406/529, 227/288, 484/625, 263/338, 562/729, 305/392, 640/841, 178/225, 24/31, ...
The limit of r(n) for n-> infinity is A323669 = 0.759908877317533285829...
r(10^5) is approximatly 0.7599142240 (10 digits).

Arnold Walfisz, Weylsche Exponentialsummen in der neueren Zahlentheorie, VEB Deutscher Verlag der Wissenschaften, Berlin, 1963, p. 100, Satz 2.

Eric Weisstein's World of Mathematics, Dedekind Function.
Wikipedia, Dedekind psi function.

Cf. A001615, A173290, A323669, A327341 (denominators).

psi[0] = 1; psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); a[n_] := Numerator[Sum[psi[k], {k, 1, n}]/n^2]; Array[a, 50] (* Amiram Eldar, Sep 03 2019 *)

dpsi(n) = n * sumdivmult(n, d, issquarefree(d)/d); \\ A001615
a(n) = numerator(sum(k=1, n, dpsi(k))/n^2); \\ Michel Marcus, Sep 18 2023

a(n) = numerator(r(n)), with the rationals r(n) = (1/n^2)*Sum{k=1..n}(k*Product_{p|k}(1 + 1/p)), with distinct prime p divisors of k (with empty product set to 1 for k = 1), for n >= 1.

a(n) = numerator(A173290(n)/n^2). - Amiram Eldar, Nov 24 2022

A321973 Partial sums of the Dedekind psi_2(k) function, for 1 <= k <= n.

Original entry on oeis.org

0, 1, 6, 16, 36, 62, 112, 162, 242, 332, 462, 584, 784, 954, 1204, 1464, 1784, 2074, 2524, 2886, 3406, 3906, 4516, 5046, 5846, 6496, 7346, 8156, 9156, 9998, 11298, 12260, 13540, 14760, 16210, 17510, 19310, 20680, 22490, 24190, 26270, 27952, 30452, 32302, 34742

Offset: 0

Daniel Suteu, Nov 22 2018

In general, for m >= 1, Sum_{k=1..n} psi_m(k) = Sum_{k=1..n} mu(k)^2 * (Bernoulli(m+1, 1+floor(n/k)) - Bernoulli(m+1, 1)) / (m+1), where mu(k) is the Moebius function and Bernoulli(n,x) are the Bernoulli polynomials.

In general, for m >= 1, Sum_{k=1..n} psi_m(k) ~ n^(m+1) * zeta(m+1) / ((m+1) * zeta(2*(m+1))).

Wikipedia, Dedekind psi function

Cf. A001615, A065958, A173290.

a[n_] := Sum[MoebiusMu[k]^2 * BernoulliB[3, 1 + Floor[n/k]], {k, 1, n}]/3; Array[a, 50, 0] (* Amiram Eldar, Nov 23 2018 *)

a(n) = sum(k=1, n, moebius(k)^2 * ((n\k)^3/3 + (n\k)^2/2 + (n\k)/6));

a(n) = Sum_{k=1..n} A065958(k).
a(n) ~ n^3 * zeta(3) / (3*zeta(6)).
a(n) = Sum_{k=1..n} mu(k)^2 * Bernoulli(3, 1+floor(n/k)) / 3.

A357818 Numerators of the partial sums of the reciprocals of the Dedekind psi function (A001615).

Original entry on oeis.org

1, 4, 19, 7, 23, 2, 17, 53, 55, 169, 175, 89, 641, 1303, 331, 1345, 1373, 1387, 7061, 2377, 9613, 29119, 29539, 29749, 6017, 6065, 6121, 6163, 31151, 31291, 15803, 3977, 16013, 48319, 24317, 12211, 233899, 58774, 472757, 59344, 119543, 1918673, 21249043, 21336823

Offset: 1

Amiram Eldar, Oct 14 2022

			Fractions begin with 1, 4/3, 19/12, 7/4, 23/12, 2, 17/8, 53/24, 55/24, 169/72, 175/72, 89/36, ...

Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 100, p. 169.
V. Sita Ramaiah and D. Suryanarayana, Sums of reciprocals of some multiplicative functions, Mathematical Journal of Okayama University, Vol. 21, No. 2 (1979), pp. 155-164.
László Tóth, Alternating Sums Concerning Multiplicative Arithmetic Functions, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.1.

Cf. A001615, A173290, A357819 (denominators).
Cf. A001620, A065463, A335707.
Similar sequences: A028415, A104528, A212717.

psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); psi[1] = 1; Numerator[Accumulate[1/Array[psi[#] &, 50]]]

f(n) = n * sumdivmult(n, d, issquarefree(d)/d); \\ A001615
a(n) = numerator(sum(k=1, n, 1/f(k))); \\ Michel Marcus, Oct 15 2022

a(n) = numerator(Sum_{k=1..n} 1/psi(k)).

a(n)/A357819(n) ~ C * (log(n) + gamma + D) + O(log(n)^(2/3) * log(log(n))^(4/3) / n), where C = Product_{p prime} (1 - 1/(p*(p+1))) (A065463), and D = Sum_{p prime} log(p)/(p^2+p-1) (A335707) (Sita Ramaiah and Suryanarayana, 1979; Tóth, 2017).

A357819 Denominators of the partial sums of the reciprocals of the Dedekind psi function (A001615).

Original entry on oeis.org

1, 3, 12, 4, 12, 1, 8, 24, 24, 72, 72, 36, 252, 504, 126, 504, 504, 504, 2520, 840, 3360, 10080, 10080, 10080, 2016, 2016, 2016, 2016, 10080, 10080, 5040, 1260, 5040, 15120, 7560, 3780, 71820, 17955, 143640, 17955, 35910, 574560, 6320160, 6320160, 6320160, 6320160

Offset: 1

Amiram Eldar, Oct 14 2022

See A357818 for more details.

Cf. A001615, A173290, A357818 (numerators).

Similar sequences: A048049, A104529, A212718.

psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); psi[1] = 1; Denominator[Accumulate[1/Array[psi[#] &, 50]]]

f(n) = n * sumdivmult(n, d, issquarefree(d)/d); \\ A001615
a(n) = denominator(sum(k=1, n, 1/f(k))); \\ Michel Marcus, Oct 15 2022

a(n) = denominator(Sum_{k=1..n} 1/psi(k)).

cp's OEIS Frontend

A309272 Numbers m such that m divides A173290(m) = Sum_{k=1..m} psi(k), where psi is the Dedekind psi function (A001615).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A001615 Dedekind psi function: n * Product_{p|n, p prime} (1 + 1/p).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

Python

Sage

Formula

Extensions

A357817 Partial alternating sums of the Dedekind psi function (A001615): a(n) = Sum_{k=1..n} (-1)^(k+1) * psi(k).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A357820 Numerators of the partial alternating sums of the reciprocals of the Dedekind psi function (A001615).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A357821 Denominators of the partial alternating sums of the reciprocals of the Dedekind psi function (A001615).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Formula

A327340 Numerator of the rationals r(n) = (1/n^2)*Phi_1(n), with Phi_1(n) = Sum{k=1..n} psi(k), with Dedekind's psi function.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A321973 Partial sums of the Dedekind psi_2(k) function, for 1 <= k <= n.

Views

Author