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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053149 Smallest cube divisible by n. 6
1, 8, 27, 8, 125, 216, 343, 8, 27, 1000, 1331, 216, 2197, 2744, 3375, 64, 4913, 216, 6859, 1000, 9261, 10648, 12167, 216, 125, 17576, 27, 2744, 24389, 27000, 29791, 64, 35937, 39304, 42875, 216, 50653, 54872, 59319, 1000, 68921, 74088, 79507, 10648 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

H. Bottomley, Some Smarandache-type multiplicative sequences

FORMULA

a(n) =(n/A000189(n))^3 =A008834(n)*A019554(A050985(n))^3 =n*A050985(n)^2/A000188(A050985(n))^3

a(n) = n * A048798(n). [From Franklin T. Adams-Watters, Apr 08 2009]

MATHEMATICA

a[n_] := For[k = 1, True, k++, If[ Divisible[c = k^3, n], Return[c]]]; Table[a[n], {n, 1, 44}] (* Jean-Fran├žois Alcover, Sep 03 2012 *)

f[p_, e_] := p^(e + Mod[3 - e, 3]); a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Aug 29 2019 *)

scdn[n_]:=Module[{c=Ceiling[Surd[n, 3]]}, While[!Divisible[c^3, n], c++]; c^3]; Array[scdn, 50] (* Harvey P. Dale, Jun 13 2020 *)

CROSSREFS

Cf. A000189, A007913, A019554, A050985.

Sequence in context: A088378 A005064 A056551 * A102637 A250140 A070510

Adjacent sequences:  A053146 A053147 A053148 * A053150 A053151 A053152

KEYWORD

nonn,mult

AUTHOR

Henry Bottomley, Feb 28 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 10 18:17 EDT 2021. Contains 342853 sequences. (Running on oeis4.)