login
A347516
Number of divisors of n that are at most n^(1/3).
3
1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 2, 3, 1, 3, 1, 3, 2
OFFSET
1,8
LINKS
FORMULA
G.f.: Sum_{k>=1} x^(k^3)/(1 - x^k).
MATHEMATICA
a[n_] := DivisorSum[n, 1 &, # <= n^(1/3) &]; Array[a, 100] (* Amiram Eldar, Sep 04 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, d^3<=n);
(PARI) N=99; x='x+O('x^N); Vec(sum(k=1, N^(1/3), x^k^3/(1-x^k)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Sep 04 2021
STATUS
approved