|
| |
|
|
A284360
|
|
Smallest positive k such that exactly half of the first k positive integers have n or fewer divisors.
|
|
0
|
|
|
|
2, 10, 22, 596, 606, 4356, 4402, 26857390, 26956576, 39877528, 39877576, 7435118530, 7435118622, 8036090130, 8036485212
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
For prime p, lim_{p -> inf} a(p-1)/a(p) = 1. For example, a(10)/a(11) = 39877528/39877576 = 0.999998796..., which is so close to 1 because of the relative scarcity of numbers having exactly 11 divisors (i.e., numbers that are 10th powers of primes): at k = a(10) = 39877528, there are exactly a(10)/2 = 19938764 numbers in [1..k] that have 10 or fewer divisors, and only 3 (namely, 2^10, 3^10, and 5^10) that have exactly 11 divisors, so the number of numbers in [1..k] having 11 or fewer divisors is only slightly more than k/2, and the proportion falls to exactly 1/2 relatively quickly as k is increased beyond a(10).
Given that the proportion of numbers in [10^n + 1, 10^n + 10^5] having 16 or fewer divisors for n = 12..20 is, respectively, about 61.2%, 59.4%, 57.6%, 56.0%, 54.7%, 53.3%, 51.9%, 50.9%, 49.9%, it seems likely that a(16) is roughly 10^20. - Jon E. Schoenfield, Oct 30 2017
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
For each of the first several positive integers k, the table below shows its number of divisors d(k), the number of numbers in [1..k] with exactly n divisors, and the number of numbers in [1..k] with n or fewer divisors. (In the "d(k) = n" portion of the table, a "." indicates that the value is unchanged relative to the row above it.)
.
Number of numbers in [1..k] ...
-------------------------------
with d(k) = n with d(k) <= n
-------------- --------------
k d(k) n = 1 2 3 4 n = 1 2 3 4
== ==== ============== ==============
1 1 1 0 0 0 1 1 1 1
2 2 . 1 . . *1* 2 2 2
3 2 . 2 . . 1 3 3 3
4 3 . . 1 . 1 3 4 4
5 2 . 3 . . 1 4 5 5
6 4 . . . 1 1 4 5 6
7 2 . 4 . . 1 5 6 7
8 4 . . . 2 1 5 6 8
9 3 . . 2 . 1 5 7 9
10 4 . . . 3 1 *5* 7 10
.
Asterisks in the "d(k) <= n" portion of the table highlight the first two terms of this sequence:
a(1) = 2 because the number of positive integers with d(k) <= 1 first drops to exactly k/2 at k = 2.
a(2) = 10 because the number of positive integers with d(k) <= 2 first drops to exactly k/2 at k = 10.
|
|
|
MATHEMATICA
|
k=1; cnt=Array[0&, 7]; n=0; Reap[While[k <= 7, Do[cnt[[i]]++, {i, DivisorSigma[0, ++n], 7}]; If[ cnt[[k]] == n/2, Sow[n]; k++]]][[2, 1]] (* Giovanni Resta, Mar 25 2017 *)
|
|
|
PROG
|
(PARI) a(n) = my(k = 2); while (sum(k=1, k, numdiv(k) <= n) != k/2, k += 2); k; \\ Michel Marcus, Mar 26 2017
(PARI) a(n) = my(t=0, i=0); while(1, i++; if(numdiv(i) <=n, t++); if(2*t==i, return(i))) \\ David A. Corneth, Mar 26 2017
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
