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!)
 A328479 a(n) = n/A328478(n), where A328478(n) is obtained by repeatedly dividing n by the largest primorial that divides it until a fixed point is reached. 5
 1, 2, 1, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 16, 1, 6, 1, 4, 1, 2, 1, 24, 1, 2, 1, 4, 1, 30, 1, 32, 1, 2, 1, 36, 1, 2, 1, 8, 1, 6, 1, 4, 1, 2, 1, 48, 1, 2, 1, 4, 1, 6, 1, 8, 1, 2, 1, 60, 1, 2, 1, 64, 1, 6, 1, 4, 1, 2, 1, 72, 1, 2, 1, 4, 1, 6, 1, 16, 1, 2, 1, 12, 1, 2, 1, 8, 1, 30, 1, 4, 1, 2, 1, 96, 1, 2, 1, 4, 1, 6, 1, 8, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..30030 FORMULA a(n) = n / A328478(n). PROG (PARI) A111701(n) = forprime(p=2, , if(n%p, return(n), n /= p)); A328478(n) = { my(u=A111701(n)); if(u==n, return(n), return(A328478(u))); }; A328479(n) = (n/A328478(n)); CROSSREFS Cf. A002110, A053589, A111701, A328478. Sequence in context: A318441 A161510 A329379 * A340346 A193267 A327832 Adjacent sequences:  A328476 A328477 A328478 * A328480 A328481 A328482 KEYWORD nonn AUTHOR Antti Karttunen, Oct 19 2019 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 18 05:11 EDT 2021. Contains 343072 sequences. (Running on oeis4.)