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!)
A183198 Least integer k such that Floor(k*(n+1)^(2/3))<k*n^(2/3). 0
2, 1, 2, 3, 1, 2, 1, 4, 2, 3, 1, 2, 3, 1, 3, 2, 3, 1, 3, 2, 3, 1, 4, 2, 3, 1, 5, 3, 2, 3, 1, 4, 3, 2, 4, 1, 4, 2, 3, 4, 1, 4, 3, 2, 3, 1, 5, 3, 2, 3, 5, 1, 4, 3, 2, 3, 6, 1, 4, 3, 2, 3, 1, 7, 4, 3, 2, 3, 6, 1, 4, 3, 2, 3, 5, 1, 4, 3, 2, 3, 4, 1, 6, 4, 3, 2, 3, 5, 1, 5, 3, 2, 3, 4, 6, 1, 4, 3, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
Table[k=1; While[Floor[k*(n+1)^(2/3)]<=k*n^(2/3), k++]; k, {n, 100}]
CROSSREFS
Cf. A183197.
Sequence in context: A094917 A082691 A280052 * A249160 A346913 A269970
KEYWORD
nonn
AUTHOR
Clark Kimberling, Dec 29 2010
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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)