The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A348998 A167967 A160990 * A322357 A160989 A066788
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Sep 04 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 10:12 EDT 2024. Contains 373127 sequences. (Running on oeis4.)