cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A284411 Least prime p such that more than half of all integers are divisible by n distinct primes not greater than p.

Original entry on oeis.org

3, 37, 42719, 5737850066077
Offset: 1

Views

Author

Peter Munn, Mar 26 2017

Keywords

Comments

The proportion of all integers that satisfy the divisibility criterion for p=prime(m) is determined using the proportion that satisfy it over any interval of primorial(m)=A002110(m) integers.
a(4) is from De Koninck, 2009; calculation credited to David Grégoire.
a(5) is about 7.887*10^34 assuming the Riemann Hypothesis, and about 7*10^34 unconditionally (De Koninck and Tenenbaum, 2002). - Amiram Eldar, Dec 05 2024

Examples

			Exactly half of the integers are divisible by 2, so a(1)>2. Two-thirds of all integers are divisible by 2 or 3, so a(1) = 3.
		

References

  • Jean-Marie De Koninck, Those Fascinating Numbers, American Mathematical Society, 2009, pp. 13, 216 and 368.

Crossrefs

Formula

a(n) is least p=prime(m) such that 2*Sum_{k=0..n-1} A096294(m,k) < A002110(m).
log(log(a(n))) = n - b + O(1/sqrt(n)), where b = 1/3 + A077761 (De Koninck and Tenenbaum, 2002). - Amiram Eldar, Dec 05 2024

Extensions

Definition edited by N. J. A. Sloane, Apr 01 2017

A378720 a(n) is the numerator of the asymptotic density of numbers whose third smallest prime divisor is prime(n).

Original entry on oeis.org

0, 0, 1, 1, 4, 326, 628, 992, 98304, 125568, 733440, 281163264, 386427322368, 3178249003008, 12454223855616, 6450728943845376, 342348724735967232, 20218431581110665216, 39814891891080560640, 82739188294287768944640, 15336676441718784000, 61298453882755419734016000
Offset: 1

Views

Author

Robert G. Wilson v and Amiram Eldar, Dec 05 2024

Keywords

Comments

The third smallest prime divisor of a number k is the third member in the ordered list of the distinct prime divisors of k. Only numbers in A000977 have a third smallest prime divisor.
The partial sums of the fractions first exceed 1/2 after summing 4467 terms. Therefore, the median value of the distribution of the third prime divisor is prime(4467) = 42719 = A284411(3).

Examples

			The fractions begin with 0/1, 0/1, 1/30, 1/30, 4/165, 326/15015, 628/36465, 992/62985, 98304/7436429, 125568/11849255, ..., .
a(1) = a(2) = 0 since there are no numbers whose third prime divisor is 2 or 3.
a(3)/A378721(3) = 1/30 since the numbers whose third prime divisor is 5 are the numbers that are divisible by 2, 3 and 5, and their density if (1/2)*(1/3)*(1/5) = 1/30.
a(4)/A378721(4) = 1/30 since the numbers whose third prime divisor is 7 are the union of the numbers that are divisible by 2, 3 and 7 and not by 5 whose density is (1/2)*(1/3)*(1-1/5)*(1/7) = 2/105, the numbers that are divisible by 2, 5 and 7 and not by 3 whose density is (1/2)*(1-1/3)*(1/5)*(1/7) = 1/105, and the numbers that are divisible by 3, 5 and 7 and not by 2 whose density is (1-1/2)*(1/3)*(1/5)*(1/7) = 1/210, and 2/105 + 1/105 + 1/210 = 1/30.
		

References

  • József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 4, pp. 337-341.

Crossrefs

Programs

  • Mathematica
    a[n_] := Block[{p, q = Prime@ Range@ n}, p = Fold[Times, 1, q]; q = Most@ q; Plus @@ Times @@@ Subsets[q -1, {n -3}]/p]; a[1] = 0; Numerator@ Array[a, 22]
  • PARI
    a(n) = {my(v = primes(n), q = vecextract(apply(x -> x-1, v),"^-1"), p = vecprod(v), prd = vecprod(q)/p, sm = 0, sb); forsubset([#q, 2], s, sb = vecextract(q, s); sm += 1/vecprod(sb)); numerator(prd * sm);}

Formula

a(n)/A378721(n) = (1/prime(n)#) * (Product_{k=1..n-1} (prime(k) - 1)) * Sum_{j=1..n-1, i=1..j-1} 1/((prime(i)-1)*(prime(j)-1)), where prime(n)# = A002110(n) is the n-th primorial number.
Sum_{n>=1} a(n)/A378721(n) = 1.
Sum_{n=1..m} a(n)/A378721(n) > 1/2 for m >= 4467 = primepi(A284411(3)).
Showing 1-2 of 2 results.