This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066636 a(n) = A066638(n)/n, where A066638(n) is the smallest power of a squarefree kernel of n that is a multiple of n. 3
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 5, 1, 1, 1, 9, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 11, 5, 1, 1, 27, 1, 2, 1, 13, 1, 4, 1, 49, 1, 1, 1, 15, 1, 1, 7, 1, 1, 1, 1, 17, 1, 1, 1, 3, 1, 1, 3, 19, 1, 1, 1, 125, 1, 1, 1, 21, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(n) = (A007947(n)^A051903(n))/n. - Antti Karttunen, Nov 20 2017 MATHEMATICA Array[Apply[Times, #2[[All, 1]]]^Max[#2[[All, -1]] ]/#1 & @@ {#, FactorInteger@ #} &, 85] (* Michael De Vlieger, Nov 20 2017 *) PROG (PARI) A066638(n) = { if(n==1, return(1)); my(f=factor(n), me=vecmax(f[, 2])); (prod(i=1, #f~, f[i, 1])^me); }; \\ After Charles R Greathouse IV's code. A066636(n) = (A066638(n)/n); \\ Antti Karttunen, Nov 20 2017 CROSSREFS Cf. A007947, A051903, A066638. Sequence in context: A030381 A318663 A030380 * A137578 A200146 A319095 Adjacent sequences:  A066633 A066634 A066635 * A066637 A066638 A066639 KEYWORD nonn,look AUTHOR Reinhard Zumkeller, Jan 09 2002 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 December 9 19:51 EST 2019. Contains 329879 sequences. (Running on oeis4.)