|
|
A230501
|
|
Floor(Sum(d(k), k=1..n)/n), where d(k) is the number of divisors of k.
|
|
2
|
|
|
1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Except for n=0, a(n) = floor(A006218(n)/n).
|
|
LINKS
|
|
|
MATHEMATICA
|
Table[Floor[Sum[DivisorSigma[0, k], {k, n}]/n], {n, 100}] (* T. D. Noe, Oct 22 2013 *)
|
|
PROG
|
(Python)
from math import isqrt
def A230501(n): return (-(s:=isqrt(n))**2+(sum(n//k for k in range(1, s+1))<<1))//n # Chai Wah Wu, Oct 23 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|