login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048763 Smallest cube >= n. 5
0, 1, 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, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 125, 125, 125, 125, 125, 125 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

REFERENCES

F. Smarandache, Only Problems not Solutions!, Xiquan Publ. Hse., 1993.

K. Atanassov, On the 40-th and 41-st Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 4 (1998), No. 3, 101-104.

K. Atanassov, On Some of Smarandache's Problems, American Research Press, 1999, 27-32.

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

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

M. L. Perez et al., eds., Smarandache Notions Journal

F. Smarandache, Only Problems, Not Solutions!

K. Atanassov, On Some of Smarandache's Problems

MAPLE

A048763 := proc(n)

        ceil(root[3](n)) ;

        %^3 ;

end proc: # R. J. Mathar, Nov 06 2011

PROG

(Haskell)

a048763 0 = 0

a048763 n = head $ dropWhile (< n) a000578_list

-- Reinhard Zumkeller, Nov 28 2011

CROSSREFS

Cf. A048762, A201053, A000578.

Sequence in context: A048762 A201053 A160949 * A088841 A165925 A165926

Adjacent sequences:  A048760 A048761 A048762 * A048764 A048765 A048766

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

a(65), a(66) and a(67) corrected by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 28 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.