A254196 -id:A254196 - cp's OEIS frontend

A038110 Numerator of frequency of integers with smallest divisor prime(n).

1, 1, 1, 4, 8, 16, 192, 3072, 55296, 110592, 442368, 13271040, 477757440, 19110297600, 802632499200, 1605264998400, 6421059993600, 12842119987200, 770527199232000, 50854795149312000, 3559835660451840000

Offset: 1

Wouter Meeussen

Numerator of Product_{k=1..n-1} (1 - 1/prime(k)). - Jonathan Sondow, Jan 31 2014
Equivalently, denominator of Product_{k=1..n-1} prime(k)/(prime(k)-1) (cf. A060753). - N. J. A. Sloane, Apr 17 2015
Sum_{n>=1} a(n)/A038111(n) = 1. - Bob Selcoe, Jan 09 2015
a(n)/A038111(n) = (1/prime(n))*Product_{k=1..n-1} (1 - 1/prime(k)) ~ e^(-c)/ (prime(n)*log(prime(n))), where c=0.577... is the Euler constant. - Vladimir Shevelev, Jan 10 2015

			a(10) = 110592 = ( 1*2*4*6*10*12*16*18*22 ) / ( 2*3*5*11 ).

Robert Israel, Table of n, a(n) for n = 1..278
Frank Ellermann, Illustration for A002110, A005867, A038110, A060753
Fred Kline and Gerry Myerson, Identity for frequency of integers with smallest prime(n) divisor, Mathematics Stack Exchange question
Vladimir Shevelev, Generalized Newman phenomena and digit conjectures on primes, Int'l J. Math. and Math. Sci. (2008) Art. ID 908045, 1-12. See Eq. (5.8).
Jonathan Sondow and Eric Weisstein, Euler Product, World of Mathematics
Wikipedia, Mertens' theorems

Cf. A038111, A002110, A005867, A058250, A060753, A236435, A236436, A254196.

N:= 100: # for a(1) to a(N)
Q:= 1: p:= 1:
for n from 1 to N do
  p:= nextprime(p);
  A[n]:= numer(Q);
  Q:= Q * (1 - 1/p);
end:
seq(A[n],n=1..N); # Robert Israel, Jul 14 2014

Numerator@Table[ Product[ 1-1/Prime[ k ], {k, n-1} ]/Prime[ n ], {n, 64} ]
(* Wouter Meeussen *)
Numerator@Table[ Product[ 1 - 1/Prime[ k ], {k, n-1}], {n, 64} ]
(* Jonathan Sondow, Jan 31 2014 *)
Numerator@
Table[EulerPhi[Exp[Sum[MangoldtLambda[m], {m, 1, Prime[n] - 1}]]]/
Exp[Sum[MangoldtLambda[m], {m, 1, Prime[n]}]], {n, 21}]
(* Fred Daniel Kline, Jul 14 2014 *)

a(n) = numerator(prod(k=1, n-1, (1 - 1/prime(k)))); \\ Michel Marcus, Aug 05 2019

a(n) = A005867(n-1) / A058250(n-1), where A058250(m) = gcd(A005867(m), A002110(m)). [Edited by Peter Munn, Jun 29 2025]
a(n)/A060753(n) = Product_{k=1..n-1} (1 - 1/prime(k)) ~ exp(-gamma)/log(n) as n->infinity (Mertens's 3rd theorem). - Jonathan Sondow, Jan 31 2014
a(n+1)/A038111(n+1) = a(n)/A038111(n) * (prime(n)-1)/prime(n+1). - Robert Israel, Jul 14 2014
a(n) = numerator of phi(e^(psi(p_n-1)))/e^(psi(p_n)), where psi(.) is the second Chebyshev function and phi(.) is Euler's totient function. - Fred Daniel Kline, Jul 17 2014

A161527 Numerators of cumulative sums of rational sequence A038110(k)/A038111(k).

Original entry on oeis.org

1, 2, 11, 27, 61, 809, 13945, 268027, 565447, 2358365, 73551683, 2734683311, 112599773191, 4860900544813, 9968041656757, 40762420985117, 83151858555707, 5085105491885327, 341472595155548909, 24295409051193284539, 1777124696397561611347

Offset: 1

Daniel Tisdale, Jun 12 2009

By rewriting the sequence of sums as 1 - Product_{n>=1} (1 - 1/prime(n)), one can show that the product goes to zero and the sequence of sums converges to 1. This is interesting because the terms approach 1/(2*prime(n)) for large n, and a sum of such terms might be expected to diverge, since Sum_{n>=1} 1/(2*prime(n)) diverges.
Denominators appear to be given by A060753(n+1). - Peter Kagey, Jun 08 2019
A254196 appears to be a duplicate of this sequence. - Michel Marcus, Aug 05 2019

Peter Kagey, Table of n, a(n) for n = 1..400

Cf. A038110, A038111, A060753, A254196.

Numerator[Table[1 - Product[1 - (1/Prime[k]), {k,1,n}], {n,1,20}]]

r(n) = prod(k=1, n-1, (1 - 1/prime(k)))/prime(n);
a(n) = numerator(sum(k=1, n, r(k))); \\ Michel Marcus, Jun 08 2019

a(n) = A053144(n)/A058250(n). - Jamie Morken, Aug 28 2022

cp's OEIS Frontend

A038110 Numerator of frequency of integers with smallest divisor prime(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula