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!)
A087321 Smallest multiple of n which is a perfect power (at least a square) of a squarefree number. 6

%I #12 Feb 23 2021 05:21:50

%S 1,4,9,4,25,36,49,8,9,100,121,36,169,196,225,16,289,36,361,100,441,

%T 484,529,216,25,676,27,196,841,900,961,32,1089,1156,1225,36,1369,1444,

%U 1521,1000,1681,1764,1849,484,225,2116,2209,1296,49,100,2601,676,2809,216

%N Smallest multiple of n which is a perfect power (at least a square) of a squarefree number.

%H Amiram Eldar, <a href="/A087321/b087321.txt">Table of n, a(n) for n = 1..10000</a>

%F If n = p^a*q^b*r^c... p, q, r are primes and max(a, b, c, ...) = K then a(n) = p^K*q^K*r^K...

%F a(n) = A007947(n)^max(A051903(n), 2). - _David Wasserman_, May 04 2005

%e a(12) = 3*12 = 36 = 6^2.

%e a(24) = 9*24 = 216 = 6^3.

%t a[n_] := (Times @@ First@#)^(Max[Max @@ Last@#, 2]) &@ Transpose @ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Feb 23 2021 *)

%Y Cf. A007947, A051903, A072774, A087320.

%K easy,nonn

%O 1,2

%A _Amarnath Murthy_, Sep 03 2003

%E More terms from _David Wasserman_, May 04 2005

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 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)