A038110 -id:A038110 - cp's OEIS frontend

A038111 Denominator of density of integers with smallest prime factor prime(n).

2, 6, 15, 105, 385, 1001, 17017, 323323, 7436429, 19605131, 86822723, 3212440751, 131710070791, 5663533044013, 266186053068611, 613385252723321, 2783825377744303, 5855632691117327, 392327390304860909, 27855244711645124539, 2033432863950094091347, 160641196252057433216413

Offset: 1

Wouter Meeussen

Denominator of (Product_{k=1..n-1} (1 - 1/prime(k)))/prime(n). - Vladimir Shevelev, Jan 09 2015

a(n)/a(n-1) = prime(n)/q(n) where q(n) is 1 or a prime for all n < 1000. What are the first indices for which q(n) is composite? - M. F. Hasler, Dec 04 2018

			From _M. F. Hasler_, Dec 03 2018: (Start)
The density of the even numbers is 1/2, thus a(1) = 2.
The density of the numbers divisible by 3 but not by 2 is 1/6, thus a(2) = 6.
The density of multiples of 5 not divisible by 2 or 3 is 2/30, thus a(3) = 15. (End)

Robert Israel, Table of n, a(n) for n = 1..277
Fred Kline and Gerry Myerson, Identity for frequency of integers with smallest prime(n) divisor, Mathematics Stack Exchange, Jul 2014.
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).

Cf. A038110, A060753, A112037.

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

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

apply( A038111(n)=denominator(prod(k=1,n-1,1-1/prime(k)))*prime(n), [1..30]) \\ M. F. Hasler, Dec 03 2018

a(n) = denominator 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
a(n) = prime(n)*A060753(n). - Vladimir Shevelev, Jan 10 2015
a(n) = a(n-1)*prime(n)/q(n), where q(n) = 1 except for q({3, 5, 6, 10, 11, 16, 17, 18, ...}) = (2, 3, 5, 11, 7, 23, 13, 29, ...), cf. A112037. - M. F. Hasler, Dec 03 2018

Name edited by M. F. Hasler, Dec 03 2018

A060753 Denominator of 1246...(prime(n-1)-1) / (2357...prime(n-1)).

Original entry on oeis.org

1, 2, 3, 15, 35, 77, 1001, 17017, 323323, 676039, 2800733, 86822723, 3212440751, 131710070791, 5663533044013, 11573306655157, 47183480978717, 95993978542907, 5855632691117327, 392327390304860909

Offset: 1

Frank Ellermann, Apr 23 2001

Equivalently, numerator of Product_{k=1..n-1} prime(k)/(prime(k)-1) (cf. A038110). - N. J. A. Sloane, Apr 17 2015
a(n)/A038110(n) is the supremum of the abundancy index sigma(k)/k = A000203(k)/k of the prime(n-1)-smooth numbers, for n>1 (Laatsch, 1986). - Amiram Eldar, Oct 26 2021
From Amiram Eldar, Jul 10 2022: (Start)
a(n)/A038110(n) is the sum of the reciprocals of the prime(n-1)-smooth numbers, for n>1.
a(n)/A038110(n) is the asymptotic mean of the number of prime(n-1)-smooth divisors of the positive integers, for n>1 (cf. A001511, A072078, A355583). (End)

			A038110(50)/ a(50) = 0.1020..., exp(-gamma)/log(229) = 0.1033...
1*2*4/(2*3*5) = 4/15 has denominator a(4) = 15. - _Jonathan Sondow_, Jan 31 2014

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, th. 429.

Michael De Vlieger, Table of n, a(n) for n = 1..423
Frank Ellermann, Illustration for A002110, A005867, A038110, A060753.
Richard Laatsch, Measuring the abundancy of integers, Mathematics Magazine, Vol. 59, No. 2 (1986), pp. 84-92.
Jonathan Sondow and Eric Weisstein, Euler Product, MathWorld.

Cf. A000203, A002110, A005867, A038110, A038111.
Cf. A236435, A236436.
Cf. A001511, A072078, A355583.

[1] cat [Denominator((&*[NthPrime(k-1)-1:k in [2..n]])/(&*[NthPrime(k-1):k in [2..n]])):n in [2..20]]; // Marius A. Burtea, Sep 19 2019

Table[Denominator@ Product[EulerPhi@ Prime[i]/Prime@ i, {i, n}], {n, 0, 19}] (* Michael De Vlieger, Jan 10 2015 *)
{1}~Join~Denominator@ FoldList[Times, Table[EulerPhi@ Prime[n]/Prime@ n, {n, 19}]] (* Michael De Vlieger, Jul 26 2016 *)
b[0] := 0; b[n_] := b[n - 1] + (1 - b[n - 1]) / Prime[n]
Denominator@ Table[b[n], {n, 0, 20}] (* Fred Daniel Kline, Jun 27 2017 *)
Join[{1},Denominator[With[{nn=20},FoldList[Times,Prime[Range[nn]]-1]/FoldList[ Times,Prime[Range[nn]]]]]] (* Harvey P. Dale, Apr 17 2022 *)

a(n) = A002110(n) / gcd( A005867(n), A002110(n) ).
A038110(n) / a(n) ~ exp( -gamma ) / log( prime(n) ), Mertens's theorem for x = prime(n) = A000040(n).
A038110(n) / a(n) = A005867(n) / A002110(n). - corrected by Simon Tatham, Jul 26 2016
a(n) = A038111(n) / prime(n). - Vladimir Shevelev, Jan 10 2014
a(n) = A038110(n) + A161527(n-1). - Jamie Morken, Jun 19 2019

Definition corrected by Jonathan Sondow, Jan 31 2014

A084968 Multiples of 7 coprime to 30.

Original entry on oeis.org

7, 49, 77, 91, 119, 133, 161, 203, 217, 259, 287, 301, 329, 343, 371, 413, 427, 469, 497, 511, 539, 553, 581, 623, 637, 679, 707, 721, 749, 763, 791, 833, 847, 889, 917, 931, 959, 973, 1001, 1043, 1057, 1099, 1127, 1141, 1169, 1183, 1211, 1253, 1267, 1309

Offset: 1

Robert G. Wilson v, Jun 15 2003

Numbers 7*k such that gcd(k,30) = 1.

Numbers congruent to 7, 49, 77, 91, 119, 133, 161, 203 modulo 210. - Jianing Song, Nov 18 2022

			77 is in the sequence because gcd(77, 30) = 1.
84 is not in the sequence because gcd(84, 3) = 6.
91 is in the sequence because gcd(91, 30) = 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,1,-1).

Subsequence of A008589.
Fourth row of A083140.
Cf. A084967 (5), A084969 (11), A084970 (13), A332799 (17), A332798 (19), A332797 (23), A007775 (7-rough numbers).

q:= k-> igcd(k, 30)=1:
select(q, [7*i$i=1..300])[];  # Alois P. Heinz, Feb 25 2020

7Select[ Range[190], GCD[ #, 2*3*5] == 1 & ]

is(n)=gcd(210,n)==7 \\ Charles R Greathouse IV, Aug 05 2013

G.f.: 7*x*(x^8 + 6*x^7 + 4*x^6 + 2*x^5 + 4*x^4 + 2*x^3 + 4*x^2 + 6*x + 1) / ((x-1)^2*(x+1)*(x^2+1)*(x^4+1)). - Colin Barker, Feb 24 2013
Lim_{n->oo} a(n)/n = A038111(4)/A038110(4) = 105/4. - Vladimir Shevelev, Jan 20 2015
a(n) = 7*A007775(n).
a(n+8) = a(n) + 210. - Jianing Song, Nov 18 2022
Sum_{n>=1} (-1)^(n+1)/a(n) = sqrt(23 + sqrt(5) - sqrt(6*(5 + sqrt(5))))*Pi/105. - Amiram Eldar, Jul 15 2023

A084970 Numbers whose smallest prime factor is 13.

Original entry on oeis.org

13, 169, 221, 247, 299, 377, 403, 481, 533, 559, 611, 689, 767, 793, 871, 923, 949, 1027, 1079, 1157, 1261, 1313, 1339, 1391, 1417, 1469, 1651, 1703, 1781, 1807, 1937, 1963, 2041, 2119, 2171, 2197, 2249, 2327, 2353, 2483, 2509, 2561, 2587, 2743, 2873

Offset: 1

Robert G. Wilson v, Jun 15 2003

			a(2) = 13*13, a(3) = 13*17.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, order 481.

Sixth row of A083140.

Cf. A084967 (5), A084968 (7), A084969 (11), A332799 (17), A332798 (19), A332797 (23), A008365 (13-rough numbers).

Select[ 13Range@ 225, GCD[#, 2310] == 1 &] (* Robert G. Wilson v, Dec 18 2014 *)

is(n)=n%13==0 && gcd(n,2310)==1 \\ Charles R Greathouse IV, Nov 19 2014

a(n) = a(n-480) + 30030 = a(n-1) + a(n-480) - a(n-481). - Charles R Greathouse IV, Nov 19 2014
Lim_{n->infinity} a(n)/n = A038111(6)/A038110(6) = 1001/16 = 62.5625. - Vladimir Shevelev, Jan 20 2015
a(n) = 13*A008365(n).

More terms from David Wasserman, Oct 19 2004

A084969 Numbers whose smallest prime factor is 11.

Original entry on oeis.org

11, 121, 143, 187, 209, 253, 319, 341, 407, 451, 473, 517, 583, 649, 671, 737, 781, 803, 869, 913, 979, 1067, 1111, 1133, 1177, 1199, 1243, 1331, 1397, 1441, 1507, 1529, 1573, 1639, 1661, 1727, 1793, 1837, 1859, 1903, 1969, 1991, 2057, 2101, 2123, 2167, 2189, 2299, 2321

Offset: 1

Robert G. Wilson v, Jun 15 2003

Fifth row of A083140.

Integers k such that gcd(11*k, 210) = 1.

			a(2) = 11*11, a(3) = 11*13.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).

Cf. A084967 (5), A084968 (7), A084970 (13), A332799 (17), A332798 (19), A332797 (23), A008364 (11-rough numbers).

Cf. A008364, A038110, A038111, A083140.

11Select[ Range[210], GCD[ #, 2*3*5*7] == 1 & ]
Select[11*Range[0,200],GCD[#,210]==1&] (* Harvey P. Dale, Dec 23 2013 *)

is(n)=gcd(n,2310)==11 \\ Charles R Greathouse IV, Nov 19 2014

G.f.: 11*x*(x^48 +10*x^47 +2*x^46 +4*x^45 +2*x^44 +4*x^43 +6*x^42 +2*x^41 +6*x^40 +4*x^39 +2*x^38 +4*x^37 +6*x^36 +6*x^35 +2*x^34 +6*x^33 +4*x^32 +2*x^31 +6*x^30 +4*x^29 +6*x^28 +8*x^27 +4*x^26 +2*x^25 +4*x^24 +2*x^23 +4*x^22 +8*x^21 +6*x^20 +4*x^19 +6*x^18 +2*x^17 +4*x^16 +6*x^15 +2*x^14 +6*x^13 +6*x^12 +4*x^11 +2*x^10 +4*x^9 +6*x^8 +2*x^7 +6*x^6 +4*x^5 +2*x^4 +4*x^3 +2*x^2 +10*x +1) / (x^49 -x^48 -x +1). - Colin Barker, Feb 22 2013
a(n) = a(n-48) + 2310 = a(n-1) + a(n-48) - a(n-49). - Charles R Greathouse IV, Nov 19 2014
Lim_{n->infinity} a(n)/n = A038111(5)/A038110(5) = 385/8 = 48.125. - Vladimir Shevelev, Jan 20 2015
a(n) = 11*A008364(n).

a(47)-a(49) from Georg Fischer, Nov 07 2019

New name from Frank Ellermann, Feb 25 2020

A005579 a(n) = smallest number k such that Product_{i=1..k} prime(i)/(prime(i)-1) > n.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 9, 14, 22, 35, 55, 89, 142, 230, 373, 609, 996, 1637, 2698, 4461, 7398, 12301, 20503, 34253, 57348, 96198, 161659, 272124, 458789, 774616, 1309627, 2216968, 3757384, 6375166, 10828012, 18409028, 31326514, 53354259, 90945529, 155142139

Offset: 0

N. J. A. Sloane, R. K. Guy

nonn

Laatsch (1986) proved that for n >= 2, a(n) gives the smallest number of distinct prime factors in even numbers having an abundancy index > n.
The abundancy index of a number k is sigma(k)/k. - T. D. Noe, May 08 2006
The first differences of this sequence, A005347, begin the same as the Fibonacci sequence A000045. - T. D. Noe, May 08 2006
Equal to A256968 except for n = 2 and n = 3.  See comment in A256968. - Chai Wah Wu, Apr 17 2015

			The products Product_{i=1..k} prime(i)/(prime(i)-1) for k >= 0 start with 1, 2, 3, 15/4, 35/8, 77/16, 1001/192, 17017/3072, 323323/55296, 676039/110592, 2800733/442368, 86822723/13271040, 3212440751/477757440, 131710070791/19110297600, 5663533044013/802632499200, ... = A060753/A038110. So a(3) = 3.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Amiram Eldar, Table of n, a(n) for n = 0..44
Richard K. Guy, Letter to N. J. A. Sloane, 1988-04-12 (annotated scanned copy).
Richard K. Guy and N. J. A. Sloane, Correspondence, 1988.
Richard Laatsch, Measuring the abundancy of integers, Mathematics Magazine 59 (2) (1986) 84-92.
Popular Computing (Calabasas, CA), Problem 182 (Suggested by Victor Meally), Annotated and scanned copy of page 10 of Vol. 5 (No. 53, Aug 1977).

A001611 is similar but strictly different.

Cf. A000720, A001611, A005580, A060753, A023199, A038110, A072986, A091440, A256968.

(* For speed and accuracy, the second Mathematica program uses 30-digit real numbers and interval arithmetic. *)
prod=1; k=0; Table[While[prod<=n, k++; prod=prod*Prime[k]/(Prime[k]-1)]; k, {n,0,25}] (* T. D. Noe, May 08 2006 *)
prod=Interval[1]; k=0; Table[While[Max[prod]<=n, k++; p=Prime[k]; prod=N[prod*p/(p-1),30]]; If[Min[prod]>n, k, "too few digits"], {n,0,38}]

a(n)=my(s=1,k); forprime(p=2,, s*=p/(p-1); k++; if(s>n, return(k))) \\ Charles R Greathouse IV, Aug 20 2015

from sympy import nextprime
def a_list(upto: int) -> list[int]:
    L: list[int] = [0]
    count = 1; bn = 1; bd = 1; p = 2
    for k in range(1, upto + 1):
        bn *= p
        bd *= p - 1
        while bn > count * bd:
            L.append(k)
            count += 1
        p = nextprime(p)
    return L
print(a_list(1000))  # Chai Wah Wu, Apr 17 2015, adapted by Peter Luschny, Jan 25 2025

a(n) = smallest k such that A002110(k)/A005867(k) > n. - Artur Jasinski, Nov 06 2008

a(n) = PrimePi(A091440(n)) = A000720(A091440(n)) for n >= 4. - Amiram Eldar, Apr 18 2025

Edited by T. D. Noe, May 08 2006
a(26) added by T. D. Noe, Sep 18 2008
Typo corrected by Vincent E. Yu (yu.vincent.e(AT)gmail.com), Aug 14 2009
a(27)-a(36) from Vincent E. Yu (yu.vincent.e(AT)gmail.com), Aug 14 2009
Comment corrected by T. D. Noe, Apr 04 2010
a(37)-a(39) from T. D. Noe, Nov 16 2010
Edited and terms a(0)-a(1) prepended by Max Alekseyev, Jan 25 2025

A058250 GCD of n-th primorial number and its totient.

Original entry on oeis.org

1, 1, 2, 2, 6, 30, 30, 30, 30, 330, 2310, 2310, 2310, 2310, 2310, 53130, 690690, 20030010, 20030010, 20030010, 20030010, 20030010, 20030010, 821230410, 821230410, 821230410, 821230410, 13960916970, 739928599410, 739928599410

Offset: 0

Labos Elemer, Dec 05 2000

			a(6) = gcd(30030,5760) = 30.

Michael De Vlieger, Table of n, a(n) for n = 0..1000

Cf. A002110, A000010, A005867, A038110.

[seq(igcd(product(ithprime(k), k=1..m), product(ithprime(k)-1, k=1..m)), m=1..50)];

GCD[#,EulerPhi[#]]&/@Rest[FoldList[Times,1,Prime[Range[30]]]] (* Harvey P. Dale, Dec 19 2012 *)
Fold[Append[#1, {#1, #2, GCD[#1, #2]} & @@ {#4 #1, #2 (#4 - 1)} & @@ Append[#1[[-1]], #2]] &, {{1, 1, 1}}, Prime@ Range[29]][[All, -1]] (* Michael De Vlieger, Apr 25 2019 *)

a(n) = my(pr=prod(k=1, n, prime(k))); gcd(pr, eulerphi(pr)); \\ Michel Marcus, Apr 13 2019

a(n) = gcd(A002110(n), A000010(A002110(n))) = gcd(A002110(n), A005867(n)).

a(n) = A005867(n) / A038110(n+1). For example: For n = 4: a(4) = 48 / 8 = 6. - Jamie Morken, Apr 12 2019

a(0) = 1 inserted by Michael De Vlieger, Apr 13 2019

A236436 Denominator of product_{k=1..n-1} (1 + 1/prime(k)).

Original entry on oeis.org

1, 2, 1, 5, 35, 385, 715, 12155, 46189, 1062347, 30808063, 955049953, 1859834119, 76253198879, 298080686527, 14009792266769, 742518990138757, 43808620418186663, 86204059532560853, 339745411098916303, 24121924188023057513, 47591904479072518877, 3759760453846728991283

Offset: 1

Jonathan Sondow, Feb 01 2014

			(1 + 1/2)*(1 + 1/3)*(1 + 1/5)*(1 + 1/7) = 96/35 has denominator a(5) = 35.

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979; Theorem 429.

Vincenzo Librandi, Table of n, a(n) for n = 1..200
J. Sondow and E. Weisstein, MathWorld: Mertens Theorem

Cf. A038110, A060753, A072044, A072045, A236435.

Denominator@Table[Product[1 + 1/Prime[k], {k, 1, n - 1}], {n, 1, 23}]

A236435(n+1) / a(n+1) = A072045(n)/A072044(n) / A038110(n+1)/A060753(n+1) because 1+x = (1-x^2) / (1-x).

A236436(n) / a(n) = product_{k=1..n-1} (1 + 1/prime(k)) ~ (6/Pi^2)*exp(gamma)*log(n) as n -> infinity, by Mertens' theorem.

A088821 a(n) is the sum of smallest prime factors of numbers from 1 to n.

Original entry on oeis.org

0, 2, 5, 7, 12, 14, 21, 23, 26, 28, 39, 41, 54, 56, 59, 61, 78, 80, 99, 101, 104, 106, 129, 131, 136, 138, 141, 143, 172, 174, 205, 207, 210, 212, 217, 219, 256, 258, 261, 263, 304, 306, 349, 351, 354, 356, 403, 405, 412, 414, 417, 419, 472, 474, 479, 481, 484

Offset: 1

Labos Elemer, Oct 22 2003

nonn

M. Kalecki, On certain sums extended over primes or prime factors, Prace Mat, Vol. 8 (1963), pp. 121-127.
J. Sandor, D. S. Mitrinovic, B. Crstici, Handbook of Number Theory I, Volume 1, Springer, 2005, Chapter IV, p. 121.

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Project Euler, Problem 521 - Smallest prime factor

Cf. A020639, A046669, A088822, A088823, A088824, A088825.

P:=List(List([2..60],n->Factors(n)),i->i[1]);;
a:=Concatenation([0],List([1..Length(P)],i->Sum([1..i],k->P[k]))); # Muniru A Asiru, Nov 29 2018

Prepend[Accumulate[Rest[Table[FactorInteger[i][[1,1]],{i,60}]]],0] (* Harvey P. Dale, Jan 09 2011 *)

a(n) = sum(k=2, n, factor(k)[1,1]); \\ Michel Marcus, May 15 2017

a(n) ~ n^2/(2 log n) [Kalecki]. - Thomas Ordowski, Nov 29 2018

a(n) = Sum_{prime p} n(p)*p, where n(p) is the number of integers in [1,n] with smallest prime factor spf(.) = A020639(.) = p, decreasing from n(2) = floor(n/2) to n(p) = 1 for p >= sqrt(n), possibly earlier, and n(p) = 0 for p > n. One has n(p) ~ D(p)*n where D(p) = (Product_{primes q < p} 1-1/q)/p = A038110/A038111 is the density of numbers having p as smallest prime factor. - M. F. Hasler, Dec 05 2018

A236435 Numerator of Product_{k=1..n-1} (1 + 1/prime(k)).

Original entry on oeis.org

1, 3, 2, 12, 96, 1152, 2304, 41472, 165888, 3981312, 119439360, 3822059520, 7644119040, 321052999680, 1284211998720, 61642175938560, 3328677500682240, 199720650040934400, 399441300081868800, 1597765200327475200, 115039094423578214400, 230078188847156428800, 18406255107772514304000

Offset: 1

Jonathan Sondow, Feb 01 2014

A236436(n)/(a(n)*zeta(2)) is the asymptotic density of the prime(n-1)-rough squarefree numbers (squarefree numbers whose prime factors are all >= prime(n-1)) for n >= 2. E.g., A236436(2)/(a(2)*zeta(2)) = 2/(3*zeta(2)) = 4/Pi^2 (A185199) is the asymptotic density of the odd squarefree numbers (A056911), and A236436(3)/(a(3)*zeta(2)) = 1/(2*zeta(2)) = 3/Pi^2 (A104141) is the asymptotic density of the 5-rough squarefree numbers (A276378). - Amiram Eldar, Aug 26 2025

			(1 + 1/2)*(1 + 1/3)*(1 + 1/5)*(1 + 1/7) = 96/35 has numerator a(5) = 96.
Fractions begin with 1, 3/2, 2, 12/5, 96/35, 1152/385, 2304/715, 41472/12155, 165888/46189, 3981312/1062347, 119439360/30808063, 3822059520/955049953, ...

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979; Theorem 429.

Vincenzo Librandi, Table of n, a(n) for n = 1..200
Jonathan Sondow and Eric W. Weisstein, MathWorld: Mertens Theorem.

Cf. A038110, A060753, A072044, A072045, A073004, A236436 (denominators), A335004.

Cf. A013661, A056911, A104141, A185199, A276378.

Numerator@Table[ Product[ 1 + 1/Prime[ k], {k, 1, n-1}], {n, 1, 23}]

a(n+1) / A236436(n+1) = (A072045(n)/A072044(n)) / (A038110(n+1)/A060753(n+1)) because 1+x = (1-x^2) / (1-x).

a(n) / A236436(n) = Product_{k=1..n-1} (1 + 1/prime(k)) ~ (6/Pi^2)*exp(gamma)*log(n) as n -> infinity, by Mertens's theorem.

cp's OEIS Frontend

A038111 Denominator of density of integers with smallest prime factor prime(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A060753 Denominator of 1*2*4*6*...*(prime(n-1)-1) / (2*3*5*7*...*prime(n-1)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A084968 Multiples of 7 coprime to 30.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A084970 Numbers whose smallest prime factor is 13.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A084969 Numbers whose smallest prime factor is 11.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A005579 a(n) = smallest number k such that Product_{i=1..k} prime(i)/(prime(i)-1) > n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Python

A060753 Denominator of 1246...(prime(n-1)-1) / (2357...prime(n-1)).