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!)
 A056551 Smallest cube divisible by n divided by largest cube which divides n. 5
 1, 8, 27, 8, 125, 216, 343, 1, 27, 1000, 1331, 216, 2197, 2744, 3375, 8, 4913, 216, 6859, 1000, 9261, 10648, 12167, 27, 125, 17576, 1, 2744, 24389, 27000, 29791, 8, 35937, 39304, 42875, 216, 50653, 54872, 59319, 125, 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) = A053149(n)/A008834(n) = A048798(n)*A050985(n) = A056552(n)^3. EXAMPLE a(16)=8 since smallest cube divisible by 16 is 64 and smallest cube which divides 16 is 8 and 64/8=8 MATHEMATICA f[p_, e_] := p^If[Divisible[e, 3], 0, 1]; a[n_] := (Times @@ (f @@@ FactorInteger[ n]))^3; Array[a, 100] (* Amiram Eldar, Aug 29 2019*) CROSSREFS Cf. A000189, A000578, A008834, A019555, A048798, A050985, A053149, A053150, A056552. Sequence in context: A070490 A088378 A005064 * A053149 A102637 A250140 Adjacent sequences:  A056548 A056549 A056550 * A056552 A056553 A056554 KEYWORD nonn,mult AUTHOR Henry Bottomley, Jun 25 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.

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