|
|
A048766
|
|
Integer part of cube root of n. Or, number of cubes <= n. Or, n appears 3n^2 + 3n + 1 times.
|
|
45
|
|
|
0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,9
|
|
LINKS
|
K. Atanassov, On the 100th, 101st and 102nd Smarandache Problems, On Some of Smarandache's Problems, American Research Press, 1999, pp. 57-61. Reprinted in Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 5 (1999), No. 3, 94-96.
|
|
FORMULA
|
|
|
MAPLE
|
floor(root[3](n)) ;
end proc:
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
a048766 = round . (** (1/3)) . fromIntegral
a048766_list = concatMap (\x -> take (a003215 x) $ repeat x) [0..]
(Magma) [n eq 0 select 0 else Iroot(n, 3): n in [0..110]]; // Bruno Berselli, Feb 20 2015
(Python)
from sympy import integer_nthroot
def a(n): return integer_nthroot(n, 3)[0]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Charles T. Le (charlestle(AT)yahoo.com)
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|