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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052126 a(1) = 1; for n>1, a(n)=n/(largest prime dividing n). 47
1, 1, 1, 2, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 3, 8, 1, 6, 1, 4, 3, 2, 1, 8, 5, 2, 9, 4, 1, 6, 1, 16, 3, 2, 5, 12, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 16, 7, 10, 3, 4, 1, 18, 5, 8, 3, 2, 1, 12, 1, 2, 9, 32, 5, 6, 1, 4, 3, 10, 1, 24, 1, 2, 15, 4, 7, 6, 1, 16, 27, 2, 1, 12, 5, 2, 3, 8, 1, 18, 7, 4, 3, 2, 5, 32, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

For n>1, a(n)=1 if and only if n is prime. - Zak Seidov, Feb 09 2015

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = n/A006530(n).

a(n) = A130065(n)/A020639(n). - Reinhard Zumkeller, May 05 2007

EXAMPLE

a(15) = 15/(largest prime dividing 15) = 15/5 = 3.

MAPLE

a := n -> `if`(n=1, 1, n/max(numtheory[factorset](n)));

seq(a(n), n=1..97); # Peter Luschny, Jul 28 2014

MATHEMATICA

a052126[n_] := Array[If[n == 1, 1, #/FactorInteger[#][[-1]][[1]]] &, n]; a052126[97] (* Michael De Vlieger, Dec 21 2014 *)

PROG

(PARI) gpf(n)=my(f=factor(n)[, 1]); f[#f]

a(n)=if(n<4, return(1)); n/gpf(n) \\ Charles R Greathouse IV, Apr 28 2015

CROSSREFS

Cf. A000040, A006530, A032742, A130065, A020639.

Sequence in context: A270120 A009195 A072994 * A094521 A321757 A159272

Adjacent sequences:  A052123 A052124 A052125 * A052127 A052128 A052129

KEYWORD

nonn,look

AUTHOR

James A. Sellers, Jan 21 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 December 13 08:08 EST 2018. Contains 318082 sequences. (Running on oeis4.)