|
|
A061071
|
|
Number of distinct values in the list of number of divisors, d(j), j=1...n.
|
|
1
|
|
|
1, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
B. Spearman and K. S. Williams, Handbook of Estimates in the Theory of Numbers, Carleton Math. Lecture Note Series No. 14, 1975; see p. 2.2.
|
|
LINKS
|
|
|
FORMULA
|
Erdős & Mirsky show that log a(n) ~ k sqrt(log x)/log log x where k = Pi sqrt(8/3). - Charles R Greathouse IV, Dec 07 2012
|
|
MATHEMATICA
|
a[n_] = Length[Union[Table[DivisorSigma[0, w], {w, 1, n}]]]
|
|
PROG
|
(Python)
from sympy import divisor_count
def A061071(n): return len({divisor_count(i) for i in range(1, n+1)}) # Chai Wah Wu, Sep 08 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|