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!)
A048762 Largest cube <= n. 10
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
Krassimir T. Atanassov, On the 40th and 41st Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 4, No. 3 (1998), 101-104.
J. Castillo, Other Smarandache Type Functions: Inferior/Superior Smarandache f-part of x, Smarandache Notions Journal, Vol. 10, No. 1-2-3 (1999), 202-204.
LINKS
Florentin Smarandache, Only Problems, Not Solutions!.
Krassimir T. Atanassov, On Some of Smarandache's Problems, American Research Press, 1999, 27-32.
FORMULA
Sum_{n>=1} 1/a(n)^2 = Pi^4/30 + Pi^6/945 + 3*zeta(5). - Amiram Eldar, Aug 15 2022
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
Sequence in context: A269350 A195139 A010731 * A201053 A160949 A245401
KEYWORD
nonn
AUTHOR
Charles T. Le (charlestle(AT)yahoo.com)
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 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)