

A048762


Largest cube <= n.


8



0, 1, 1, 1, 1, 1, 1, 1, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 64, 64, 64
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,9


REFERENCES

K. Atanassov, On the 40th and 41st Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 4 (1998), No. 3, 101104.
J. Castillo, Other Smarandache Type Functions: Inferior/Superior Smarandache fpart of x, Smarandache Notions Journal, Vol. 10, No. 123, 1999, 202204.


LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
F. Smarandache, Only Problems, Not Solutions!
K. Atanassov, On Some of Smarandache's Problems, American Research Press, 1999, 2732.


MAPLE

A048762 := proc(n)
floor(root[3](n)) ;
%^3 ;
end proc: # R. J. Mathar, Nov 06 2011


MATHEMATICA

Floor[Surd[Range[0, 70], 3]]^3 (* Harvey P. Dale, Jun 23 2013 *)


PROG

(Haskell)
a048762 n = last $ takeWhile (<= n) a000578_list
 Reinhard Zumkeller, Nov 28 2011


CROSSREFS

Cf. A048763, A201053, A000578.
Sequence in context: A269350 A195139 A010731 * A201053 A160949 A245401
Adjacent sequences: A048759 A048760 A048761 * A048763 A048764 A048765


KEYWORD

nonn


AUTHOR

Charles T. Le (charlestle(AT)yahoo.com)


STATUS

approved



