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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057521 Powerful (1) part of n: if n = Product_i (pi^ei) then a(n) = Product_{i : ei > 1} (pi^ei); if n=b*c^2*d^3 then a(n)=c^2*d^3 when b is minimized. 22
1, 1, 1, 4, 1, 1, 1, 8, 9, 1, 1, 4, 1, 1, 1, 16, 1, 9, 1, 4, 1, 1, 1, 8, 25, 1, 27, 4, 1, 1, 1, 32, 1, 1, 1, 36, 1, 1, 1, 8, 1, 1, 1, 4, 9, 1, 1, 16, 49, 25, 1, 4, 1, 27, 1, 8, 1, 1, 1, 4, 1, 1, 9, 64, 1, 1, 1, 4, 1, 1, 1, 72, 1, 1, 25, 4, 1, 1, 1, 16, 81, 1, 1, 4, 1, 1, 1, 8, 1, 9, 1, 4, 1, 1, 1, 32, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

T. D. Noe, Table of n, a(n) for n = 1..1000

Index entries for sequences related to powerful numbers

FORMULA

a(n) = n / A055231(n).

Multiplicative with a(p)=1 and a(p^e)=p^e for e>1. - Vladeta Jovovic, Nov 01 2001

From Antti Karttunen, Nov 22 2017: (Start)

a(n) = A064549(A003557(n)).

A003557(a(n)) = A003557(n).

(End)

EXAMPLE

a(40) = 8 since 40 = 2^3 * 5 so the powerful part is 2^3 = 8.

MAPLE

A057521 := proc(n)

    local a, d, e, p;

    a := 1;

    for d in ifactors(n)[2] do

        e := d[1] ;

        p := d[2] ;

        if e > 1 then

            a := a*p^e ;

        end if;

    end do:

    return a;

end proc: # R. J. Mathar, Jun 09 2016

MATHEMATICA

rad[n_] := Times @@ First /@ FactorInteger[n]; a[n_] := n/Denominator[n/rad[n]^2]; Table[a[n], {n, 1, 97}] (* Jean-Fran├žois Alcover, Jun 20 2013 *)

PROG

(PARI) a(n)=my(f=factor(n)); prod(i=1, #f~, if(f[i, 2]>1, f[i, 1]^f[i, 2], 1)) \\ Charles R Greathouse IV, Aug 13 2013

(Python)

from sympy import factorint

from operator import mul

def a(n): return 1 if n==1 else reduce(mul, [1 if e==1 else p**e for p, e in factorint(n).items()])

print map(a, xrange(1, 151)) # Indranil Ghosh, Jul 19 2017

CROSSREFS

Cf. A001694, A003557, A055231, A064549.

Sequence in context: A212173 A274006 A203025 * A084885 A112538 A008477

Adjacent sequences:  A057518 A057519 A057520 * A057522 A057523 A057524

KEYWORD

nonn,mult

AUTHOR

Henry Bottomley, Sep 01 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 March 20 15:43 EDT 2019. Contains 321345 sequences. (Running on oeis4.)