The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104758 Number of cubes m = k^3 such that n <= m <= (n+1)^2. 3
 2, 1, 1, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(n)>=1 because between n and (n+1)^2 there is always at least one cubic number. a(6)=2 because between 5 and 6^2 there are two cubic numbers: 8 and 27 LINKS MATHEMATICA f[n_] := Floor[(n + 1)^(2/3)] - Floor[n^(1/3)] + If[ IntegerQ[n^(1/3)], 1, 0]; Table[ f[n], {n, 0, 84}] (* Robert G. Wilson v, Apr 24 2005 *) CROSSREFS Sequence in context: A237706 A064823 A140225 * A143227 A329746 A302247 Adjacent sequences:  A104755 A104756 A104757 * A104759 A104760 A104761 KEYWORD easy,nonn AUTHOR Giovanni Teofilatto, Apr 23 2005 EXTENSIONS More terms from Robert G. Wilson v, Apr 24 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 23 01:31 EDT 2021. Contains 345394 sequences. (Running on oeis4.)